✦ LIBER ✦

Two graphs without planar covers

✍ Scribed by Dan Archdeacon

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 93 KB
Volume: 41
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10075

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Minor-universal planar graphs without ac

Minor-universal planar graphs without accumulation points

✍ Daniela Kühn 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 1 views

Planar Graphs Without Cycles of Specific

Planar Graphs Without Cycles of Specific Lengths

✍ G. Fijavž; M. Juvan; B. Mohar; R. Škrekovski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 208 KB

It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that planar graphs without 5-cycles are also 3-degenerate. In this paper it is shown, more surprisingly, that the same holds for planar graphs without 6-cycles.

Planar graph colorings without short mon

Planar graph colorings without short monochromatic cycles

✍ Tomáš Kaiser; Riste Škrekovski 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract It is well known that every planar graph __G__ is 2‐colorable in such a way that no 3‐cycle of __G__ is monochromatic. In this paper, we prove that __G__ has a 2‐coloring such that no cycle of length 3 or 4 is monochromatic. The complete graph __K__~5~ does not admit such a coloring. On

Two trees in maximal planar bipartite gr

Two trees in maximal planar bipartite graphs

✍ Gerhard Ringel 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

Two-Connected Augmentation Problems in P

Two-Connected Augmentation Problems in Planar Graphs

✍ J.Scott Provan; Roger C Burk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Given a weighted undirected graph G and a subgraph S of G, we consider the problem of adding a minimum-weight set of edges of G to S so that the resulting Ž . subgraph satisfies specified edge or vertex connectivity requirements between pairs of nodes of S. This has important applications in upgradi