✦ LIBER ✦

Structure and Coloring of Graphs with Only Small Odd Cycles

✍ Scribed by Wang, Susan S.

Book ID: 118197267
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 749 KB
Volume: 22
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480197323883

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

(2 + ?)-Coloring of planar graphs with l

(2 + ?)-Coloring of planar graphs with large odd-girth

✍ Klostermeyer, William; Zhang, Cun Quan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 3 views

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f ( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f ( ), then G is (2 + )-colorable. N

New Constructions of Bipartite Graphs on

New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles

✍ F. Lazebnik; V.A. Ustimenko; A.J. Woldar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

On the 7 Total Colorability of Planar Gr

On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles

✍ Lan Shen; Yingqian Wang 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 168 KB

On Families of Graphs of Large Cycle Ind

On Families of Graphs of Large Cycle Indicator, Matrices of Large Order and Key Exchange Protocols With Nonlinear Polynomial Maps of Small Degree

✍ Romańczuk, Urszula; Ustimenko, Vasyl 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 279 KB