Avoiding 7-circuits in 2-factors of cubic graphs

zbMath1302.05145MaRDI QIDQ470948

Robert Lukot'ka

Publication date: 13 November 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p25

zbMATH Keywords

cubic graphs2-factors

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Cubic TSP: A 1.3-Approximation

Cites Work

• Unnamed Item
• The traveling salesman problem on cubic and subcubic graphs
• On 2-factors with long cycles in cubic graphs
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Avoiding 7-circuits in 2-factors of cubic graphs