Even cycles and even 2-factors in the line graph of a simple graph
From MaRDI portal
Publication:2411500
zbMath1373.05097MaRDI QIDQ2411500
Simona Bonvicini, Arrigo Bonisoli
Publication date: 24 October 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p15
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of packing and covering (05B40)
Related Items
Even cycle decompositions of index 3 by a novel coloring technique, On 4-connected 4-regular graphs without even cycle decompositions, On even cycle decompositions of line graphs of cubic graphs, \(H\)-colorings for 4-regular graphs, Strongly even cycle decomposable non-planar line graphs, Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Even cycle decompositions of 4-regular graphs and line graphs
- Construction of class two graphs with maximum vertex degree three
- Even circuits in planar graphs
- Sur l'indice chromatique du graphe représentatif des arêtes d'un graphe régulier
- Minimum number of palettes in edge colorings
- Edge-colorings of 4-regular graphs with the minimum number of palettes
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On longest paths and circuits in graphs.
- On even circuit decompositions of eulerian graphs
- Characterizations of derived graphs
- Polyhedral decompositions of cubic graphs
- Network-Colourings