Proof techniques for factor theorems

MaRDI QIDQ3509400zbMATH OpenFDO

Authors Yoshimi Egawa

Publication date 1 July 2008

Mathematics Subject Classification ID

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

Recommendations

• A note on f-factors in directed and undirected multigraphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• scientific article; zbMATH DE number 3855160
• Note: a short proof of a theorem of Tutte
• A new proof for some theorems in graph theory

Cited in

(5)

• Endpoint extendable paths in dense graphs
• Forbidden subgraphs for existences of (connected) 2-factors of a graph
• Tree in forbidden triples generating a finite set of graphs with high connectivity
• Forbidden pairs for \(k\)-connected Hamiltonian graphs
• Forbidden subgraphs for a graph to have a Hamiltonian path square

This page was built for publication: Proof techniques for factor theorems

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