Decompositions of graphs into cycles with chords

DOI10.1016/j.jctb.2017.07.002zbMath1375.05148OpenAlexW2748711308MaRDI QIDQ1682208

Hao Li, Paul N. Balister, Richard H. Schelp

Publication date: 28 November 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2017.07.002

zbMATH Keywords

cyclesdecompositions

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

The edge condition for independent cycles with chords in bipartite graphs ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Vertex-disjoint double chorded cycles in bipartite graphs ⋮ Results and problems on chorded cycles: a survey

Uses Software

• cyclechord

Cites Work

• Unnamed Item
• Neighborhood unions for the existence of disjoint chorded cycles in graphs
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Neighborhood unions and disjoint chorded cycles in graphs
• Disjoint chorded cycles in graphs
• On independent doubly chorded cycles
• On the maximal number of independent circuits in a graph

This page was built for publication: Decompositions of graphs into cycles with chords