On Dominating Even Subgraphs in Cubic Graphs

DOI10.1137/16M1066622zbMath1362.05067MaRDI QIDQ5346564

Shuya Chiba, Kiyoshi Yoshimoto, Roman Čada, Kenta Ozeki

Publication date: 24 May 2017

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

zbMATH Keywords

2-factorcubic graphdominating subgrapheven subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

2-factors of cubic bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• On a closure concept in claw-free graphs
• The traveling salesman problem on cubic and subcubic graphs
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• An improved upper bound for the TSP in cubic 3-edge-connected graphs
• Hamiltonian results inK1,3-free graphs
• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• Spanning even subgraphs of 3‐edge‐connected graphs
• Cycles in digraphs– a survey
• Reflections on graph theory
• TSP Tours in Cubic Graphs: Beyond 4/3
• Avoiding 5-Circuits in 2-Factors of Cubic Graphs

This page was built for publication: On Dominating Even Subgraphs in Cubic Graphs