scientific article; zbMATH DE number 3150487

MaRDI QIDQ3267903zbMATH OpenFDO

Authors Anton Kotzig

Publication date 1959

Full work available at URL https://dml.cz/handle/10338.dmlcz/126725

zbMATH Keywords

finite graphslinear factors

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• Ein Kriterium für das Vorhandensein von Faktoren in beliebigen Graphen
• scientific article; zbMATH DE number 3013445 (Why is no real title available?)

Cited in

(20)

• Ear-decompositions of matching-covered graphs
• Brick decompositions and the matching rank of graphs
• Matching theory -- a sampler: From Dénes König to the present
• Odd factors of a graph
• On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
• Toughness and matching extension in graphs
• Distance spectrum, 1-factor and vertex-disjoint cycles
• Spectral radius and \([a,b]\)-factors in graphs
• Clar structures vs Fries structures in hexagonal systems
• Packing resonant hexagons in fullerenes
• Uniquely forced perfect matching and unique 3-edge-coloring
• scientific article; zbMATH DE number 3957137 (Why is no real title available?)
• The factorization of graphs. II
• On the structure of factorizable graphs
• On the structure of factorizable graphs. II
• The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs
• On sign-invertible graphs
• Eigenvalues and factors: a survey
• Graph factors and factorization: 1985--2003: a survey
• Forcing matching numbers of fullerene graphs

This page was built for publication:

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