Decompositions of graphs into cycles with chords
From MaRDI portal
(Redirected from Publication:1682208)
Recommendations
Cites work
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- Disjoint chorded cycles in graphs
- Neighborhood unions and disjoint chorded cycles in graphs
- Neighborhood unions for the existence of disjoint chorded cycles in graphs
- On a sharp degree sum condition for disjoint chorded cycles in graphs
- On independent doubly chorded cycles
- On the maximal number of independent circuits in a graph
Cited in
(10)- scientific article; zbMATH DE number 2108151 (Why is no real title available?)
- Results and problems on chorded cycles: a survey
- The edge condition for independent cycles with chords in bipartite graphs
- scientific article; zbMATH DE number 3922692 (Why is no real title available?)
- Vertex-disjoint double chorded cycles in bipartite graphs
- Partitioning a graph into cycles with a specified number of chords
- scientific article; zbMATH DE number 5059992 (Why is no real title available?)
- 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
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)