Spanning even subgraphs of 3‐edge‐connected graphs

DOI10.1002/jgt.20386zbMath1180.05057MaRDI QIDQ3652540

Kiyoshi Yoshimoto, Bill Jackson

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20386

zbMATH Keywords

bipartite graph; triangle-free graph; longest cycle; dominating cycle; edge degree; bridgeless graphs; spanning even subgraph; remote edges

Mathematics Subject Classification ID

05C38: Paths and cycles

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C40: Connectivity

Related Items

On Dominating Even Subgraphs in Cubic Graphs, Induced path factors of regular graphs, 2-factors in claw-free graphs with lower bounds cycle lengths, Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs, The structure of even factors in claw-free graphs, Edge-connectivity and edges of even factors of graphs, 2-factors of cubic bipartite graphs, On line graphs of subcubic triangle-free graphs, A 4/3-approximation for TSP on cubic 3-edge-connected graphs, Even subgraphs of bridgeless graphs and 2-factors of line graphs, On the number of components in 2-factors of claw-free graphs, 2-factors with bounded number of components in claw-free graphs

Cites Work

• On hamiltonian line graphs and connectivity
• Flows and generalized coloring theorems in graphs
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• A Reduction Method for Edge-Connectivity in Graphs