On 4-connected graphs without even cycle decompositions
From MaRDI portal
Recommendations
- On 4-connected 4-regular graphs without even cycle decompositions
- Four-cycles in graphs without a given even cycle
- Nonseparating Cycles in 4-Connected Graphs
- Even-cycle decompositions of graphs with no odd-K₄-minor
- scientific article; zbMATH DE number 89768
- On relating edges in graphs without cycles of length 4
- On even cycle decompositions of 4-regular line graphs
- Even cycle decompositions of 4-regular graphs and line graphs
- Extremal graphs without 4-cycles
- Graphs without four-cycles
Cited in
(14)- Superposition and constructions of graphs without nowhere-zero k-flows
- Connectivity of abelian Cayley graphs containing no K₄
- On 4-connected 4-regular graphs without even cycle decompositions
- On even cycle decompositions of line graphs of cubic graphs
- Corrigendum to: ``On even cycle decompositions of 4-regular line graphs
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles
- Even-cycle decompositions of graphs with no odd-K₄-minor
- On graphs and algebraic graphs that do not contain cycles of length 4
- Circuit decompositions of cones and prisms over trees of odd degrees
- On even cycle decompositions of 4-regular line graphs
- Even cycle decompositions of 4-regular graphs and line graphs
- scientific article; zbMATH DE number 2145243 (Why is no real title available?)
- scientific article; zbMATH DE number 6906 (Why is no real title available?)
- Even cycle decompositions of the line graphs of cubic graphs
This page was built for publication: On 4-connected graphs without even cycle decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936064)