The number of cycles in 2-factors of cubic graphs

DOI10.1016/0012-365X(90)90133-3zbMath0728.05051MaRDI QIDQ804602

Moshe Rosenfeld

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

planar graphs2-factorcubic graphs

Mathematics Subject Classification ID

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

Related Items

Circuits of length 5 in 2-factors of cubic graphs, Small snarks with large oddness, Coloring face-hypergraphs of graphs on surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Pairs of edge-disjoint Hamiltonian circuits
• Shortness exponents of families of graphs
• A Theorem on Planar Graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Trees in Polyhedral Graphs
• On Hamiltonian Circuits