✦ LIBER ✦

Projective-Planar Graphs with No K3, 4-Minor

✍ Scribed by John Maharry; Daniel Slilaty

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 214 KB
Volume: 70
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20603

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

📜 SIMILAR VOLUMES

Projective-planar graphs with even duals

✍ Seiya Negami 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract Let __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 embeddi

Re-embedding structures of 4-connected p

Re-embedding structures of 4-connected projective-planar graphs

✍ Yusuke Suzuki 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

We identify the structures of 4-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane, showing two series of graphs the number of whose inequivalent embeddings is held by O(n) with respect to the number of its vertices n.

Another two graphs with no planar covers

✍ Petr Hlinĕný 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A graph __H__ is a cover of a graph __G__ if there exists a mapping φ from V(__H__) onto V(__G__) such that φ maps the neighbors of every vertex υ in __H__ bijectively to the neighbors of φ(υ) in __G__. Negami conjectured in 1986 that a connected graph has a finite planar cover if and o

A Characterization of Graphs with No Cub

A Characterization of Graphs with No Cube Minor

✍ John Maharry 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 418 KB

In this paper it is shown that any 4-connected graph that does not contain a minor isomorphic to the cube is a minor of the line graph of V n for some n 6 or a minor of one of five graphs. Moreover, there exists a unique 5-connected graph on at least 8 vertices with no cube minor and a unique 4-conn

A Splitter for Graphs with No Petersen F

A Splitter for Graphs with No Petersen Family Minor

✍ John Maharry 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The Petersen family consists of the seven graphs that can be obtained from the Petersen Graph by Y2-and 2Y-exchanges. A splitter for a family of graphs is a maximal 3-connected graph in the family. In this paper, a previously studied graph, Q 13, 3 , is shown to be a splitter for the set of all grap

Planar Graphs with Circular Chromatic Nu

Planar Graphs with Circular Chromatic Numbers between 3 and 4

✍ Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 284 KB

This paper proves that for every rational number r between 3 and 4, there exists a planar graph G whose circular chromatic number is equal to r. Combining this result with a recent result of Moser, we arrive at the conclusion that every rational number r between 2 and 4 is the circular chromatic num