Decompositions of graphs into cycles with chords
From MaRDI portal
Publication:1682208
DOI10.1016/J.JCTB.2017.07.002zbMATH Open1375.05148OpenAlexW2748711308MaRDI QIDQ1682208FDOQ1682208
Authors: Hao Li, Paul Balister, R. 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
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On the maximal number of independent circuits in a graph
- Title not available (Why is that?)
- On a sharp degree sum condition for disjoint chorded cycles in graphs
- Disjoint chorded cycles in graphs
- Neighborhood unions for the existence of disjoint chorded cycles in graphs
- Neighborhood unions and disjoint chorded cycles in graphs
- On independent doubly chorded cycles
Cited In (10)
- Title not available (Why is that?)
- Results and problems on chorded cycles: a survey
- The edge condition for independent cycles with chords in bipartite graphs
- Title not available (Why is that?)
- Vertex-disjoint double chorded cycles in bipartite graphs
- Partitioning a graph into cycles with a specified number of chords
- Title not available (Why is that?)
- Vertex-disjoint chorded cycles in a graph
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Properly colored cycles of different lengths in edge-colored complete graphs
Uses Software
This page was built for publication: Decompositions of graphs into cycles with chords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682208)
