Multigraphs with quasiweak odd cycles
β Scribed by D de Werra
- Book ID
- 103502628
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 450 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Gyarf&, A., Graphs with k odd cycle lengths, Discrete Mathematics 103 (1992) 41-48. If G is a graph with k z 1 odd cycle lengths then each block of G is either KZk+2 or contains a vertex of degree at most 2k. As a consequence, the chromatic number of G is at most 2k + 2. For a graph G let L(G) deno
Chen, C. and J. Wang, Factors in graphs with odd-cycle property, Discrete Mathematics 112 (1993) 29-40. We present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a graph G with the odd-cycle property that any two odd cycles of G either have a vertex in common or are