Even factor of a graph with a bounded number of components

MaRDI QIDQ3001211zbMATH OpenFDO

Authors Zhaohong Niu, Liming Xiong

Publication date 31 May 2011

zbMATH Keywords

spanning subgrapheven factorreduced graphspanning even subgraph

Mathematics Subject Classification ID

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

Recommendations

• Even factors of graphs
• Even [a,b]-factors in graphs
• Edge-connectivity and edges of even factors of graphs
• Even factor of bridgeless graphs containing two specified edges.
• Even factors of large size

Cited in

(11)

• Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
• Maximum even factors of graphs
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• The structure of even factors in claw-free graphs
• A characterization of graphs without even factors
• Even factors in edge-chromatic-critical graphs with a small number of divalent vertices
• Even factors of graphs
• Even factors with a bounded number of components in iterated line graphs
• Even factors of large size
• Connected even factors in the square of essentially 2-edge-connected graph
• On extremal k-supereulerian graphs

This page was built for publication: Even factor of a graph with a bounded number of components

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