On Petersen's graph theorem

DOI10.1016/0012-365X(81)90257-0MaRDI QIDQ1148334zbMATH OpenOpenAlexFDO

Authors Nathan Linial

Publication date 1981

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(81)90257-0

zbMATH Keywords

edge-connectednessfactorizationspanning subgraph

Mathematics Subject Classification ID

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

Cites work

• A Short Proof of the Factor Theorem for Finite Graphs
• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3390835 (Why is no real title available?)
• On defect-d matchings in graphs
• Spanning subgraphs with specified valencies
• Subgraphs with prescribed valencies

Cited in

(1)

• An approach to the girth problem in cubic graphs

This page was built for publication: On Petersen's graph theorem

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