𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edges in graphs with large girth

✍ Scribed by R. D. Dutton; R. C. Brigham

Publisher
Springer Japan
Year
1991
Tongue
English
Weight
365 KB
Volume
7
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

List edge chromatic number of graphs wit
List edge chromatic number of graphs with large girth
✍ A.V. Kostochka πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 785 KB

Kostochka, A.V., List edge chromatic number of graphs with large girth, Discrete Mathematics 101 (1992) 189-201. It is shown that the list edge chromatic number of any graph with maximal degree A and girth at least 8A(ln A + 1.1) is equal to A + 1 or to A. Conjecture 1. The list edge chromatic numbe

UniquelyH-colorable graphs with large gi
UniquelyH-colorable graphs with large girth
✍ Zhu, Xuding πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 498 KB πŸ‘ 2 views

Suppose G and H are graphs. We say G is H-colorable if there is a homomorphism (edge-preserving vertex mapping) from G to H. We say a graph G is uniquely H-colorable if there is an onto homomorphism c from G to H, and any other homomorphism from G to H is the composition o o c of c with an automorph

4-chromatic graphs with large odd girth
4-chromatic graphs with large odd girth
✍ Nguyen Van Ngoc; Zsolt Tuza πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 251 KB

It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lov~sz. The proof presented here is elementary combinatorial.