Even factors of graphs

DOI10.1007/S10878-016-0038-4MaRDI QIDQ2012889zbMATH OpenOpenAlexFDO

Authors Jian Cheng, Cun-Quan Zhang, Bao-Xuan Zhu

Publication date 3 August 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-016-0038-4

zbMATH Keywords

extremal graph theory2-factorspanning subgraphmaximum even factor

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)

Recommendations

• Maximum even factors of graphs
• Large even factors of graphs
• Odd factors of a graph
• Even factor of a graph with a bounded number of components
• Factors and factorization of graphs
• scientific article; zbMATH DE number 3904628
• Factors of regular graphs
• scientific article; zbMATH DE number 3869380
• scientific article; zbMATH DE number 874568

Cites work

• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Even factors of large size
• Maximum even factors of graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem

Cited in

(9)

• Graphs containing every 2-factor
• Even factor of bridgeless graphs containing two specified edges.
• Maximum even factors of graphs
• Even factor of a graph with a bounded number of components
• Large even factors of graphs
• A characterization of graphs without even factors
• Even factors of large size
• Spanning Eulerian subgraphs of large size
• Edge-connectivity and edges of even factors of graphs

This page was built for publication: Even factors of graphs

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