𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homomorphisms of Products of Graphs into Graphs Without Four Cycles

✍ Scribed by Christian Delhommé; Norbert Sauer

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
185 KB
Volume
22
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of homomorphisms to direct pr
Complexity of homomorphisms to direct products of graphs
✍ Judit Büki; Csaba Szabó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 55 KB

For a graph G, OAL G asks whether or not an input graph H together with a partial map g : G 2 are trees and NP-complete otherwise.

Choosability of toroidal graphs without
Choosability of toroidal graphs without short cycles
✍ Leizhen Cai; Weifan Wang; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract Let __G__ be a toroidal graph without cycles of a fixed length __k__, and χ~__l__~(__G__) the list chromatic number of __G__. We establish tight upper bounds of χ~__l__~(__G__) for the following values of __k__: © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1–15, 2010.

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.

Hamilton cycles in strong products of gr
Hamilton cycles in strong products of graphs
✍ Daniel Král'; Jana Maxová; Robert Šámal; Pavel Podbrdský 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

## Abstract We prove that the strong product of any __n__ connected graphs of maximum degree at most __n__ contains a Hamilton cycle. In particular, __G__^Δ(__G__)^ is hamiltonian for each connected graph __G__, which answers in affirmative a conjecture of Bermond, Germa, and Heydemann. © 2005 Wile