Large even factors of graphs

DOI10.1007/s10878-017-0161-xzbMath1386.05150OpenAlexW2742737941MaRDI QIDQ1698066

Jing Chen, Geng-Hua Fan

Publication date: 21 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10878-017-0161-x

zbMATH Keywords

2-factorextremal graphspanning subgrapheven factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Maximum even factors of graphs
• Flows and generalized coloring theorems in graphs
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• On maximum number of edges in a spanning eulerian subgraph
• Even factors of graphs
• Even Factors of Large Size

This page was built for publication: Large even factors of graphs