Maximum even factors of graphs

DOI10.1016/J.JCTB.2016.03.002MaRDI QIDQ273183zbMATH OpenOpenAlexFDO

Authors Fuyuan Chen, Genghua Fan

Publication date 21 April 2016

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2016.03.002

zbMATH Keywords

2-factoreven graphlarge even factorspanning subgraph

Mathematics Subject Classification ID

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

Recommendations

• Even factors of graphs
• Large even factors of graphs
• Even factors of large size
• Even [a,b]-factors in graphs
• Even factor of a graph with a bounded number of components

Cites work

• A note on graphs spanned by Eulerian graphs
• Even factors of large size
• Flows and generalized coloring theorems in graphs
• On maximum number of edges in a spanning eulerian subgraph
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem

Cited in

(4)

• Large even factors of graphs
• Even factors of large size
• On specific factors in graphs
• Even factors of graphs

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

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