The number of cycles in 2-factors of cubic graphs

DOI10.1016/0012-365X(90)90133-3zbMATH Open0728.05051MaRDI QIDQ804602FDOQ804602

Moshe Rosenfeld

Publication date: 1990

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

Recommendations

• Avoiding 5-Circuits in 2-Factors of Cubic Graphs
• On 2-factors with long cycles in cubic graphs
• Short cycle covers on cubic graphs by choosing a 2-factor
• scientific article; zbMATH DE number 3963871
• Disconnected 2-factors in planar cubic bridgeless graphs

zbMATH Keywords

cubic graphsplanar graphs2-factor

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)

Cites Work

• Graph theory
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• A Theorem on Planar Graphs
• Title not available (Why is that?)
• Trees in Polyhedral Graphs
• On Hamiltonian Circuits
• Pairs of edge-disjoint Hamiltonian circuits
• Shortness exponents of families of graphs

Cited In (9)

• Title not available (Why is that?)
• The upper bound of the number of cycles in a 2-factor of a line graph
• Small snarks with large oddness
• Circuits of length 5 in 2-factors of cubic graphs
• Coloring face-hypergraphs of graphs on surfaces
• Disconnected 2-factors in planar cubic bridgeless graphs
• Note on robust coloring of planar graphs
• Avoiding 5-Circuits in 2-Factors of Cubic Graphs
• Title not available (Why is that?)

This page was built for publication: The number of cycles in 2-factors of cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804602)