๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Regular Graphs with No Homomorphisms onto Cycles

โœ Scribed by I.M. Wanless; N.C. Wormald

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
97 KB
Volume
82
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

โœฆ Synopsis

We prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism onto the cycle C s , where (d, s)=(3, 9) and (4, 5).

๐Ÿ“œ SIMILAR VOLUMES

Total domination in 2-connected graphs a
Total domination in 2-connected graphs and in graphs with no induced 6-cycles
โœ Michael A. Henning; Anders Yeo ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 272 KB ๐Ÿ‘ 1 views

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__. The minimum cardinality of a total dominating set of __G__ is the total domination number ฮณ~t~(__G__) of __G__. It is known [J Graph Theory 35 (2000)

A structure theorem for graphs with no c
A structure theorem for graphs with no cycle with a unique chord and its consequences
โœ Nicolas Trotignon; Kristina Vuลกkoviฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 321 KB

## Abstract We give a structural description of the class ๐’ž of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in ๐’ž is either in some simple basic class or has a decomposition. Basic classes are chordless cycles, cliqu