On Petersen's graph theorem

DOI10.1016/0012-365X(81)90257-0zbMath0452.05048OpenAlexW2074892931MaRDI QIDQ1148334

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

factorizationspanning subgraphedge-connectedness

Mathematics Subject Classification ID

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

Cites Work

• On defect-d matchings in graphs
• Spanning subgraphs with specified valencies
• Subgraphs with prescribed valencies
• A Short Proof of the Factor Theorem for Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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