Projective‐planar graphs with even duals
Copyright policy )Projective‐planar graphs with even duals
AbstractLet G be a connected graph which is projective‐planar but is not planar. It will be shown that G can be embedded in the projective plane so that it has only even faces if and only if either G is bipartite or its canonical bipartite covering is planar and that such an embedding is unique if G is 3‐connected.
bipartite covering, embedding, projective-planar graphs, even faces, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), projective plane, nonplanar graph, Planar graphs; geometric and topological aspects of graph theory
bipartite covering, embedding, projective-planar graphs, even faces, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), projective plane, nonplanar graph, Planar graphs; geometric and topological aspects of graph theory
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!