Spanning subgraphs with specified valencies. (Reprint)

DOI10.1016/J.DISC.2006.03.014zbMATH Open1094.05044OpenAlexW4205847801MaRDI QIDQ2497993FDOQ2497993

Authors: William T. Tutte 

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.014

Recommendations

• scientific article; zbMATH DE number 4083675
• 2-connected spanning subgraphs of planar 3-connected graphs
• Almost-spanning subgraphs with bounded degree in dense graphs
• A degree condition for spanning eulerian subgraphs
• Subgraphs of graphs. I

Mathematics Subject Classification ID

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

Cites Work

• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Short Proof of the Factor Theorem for Finite Graphs
• Title not available (Why is that?)
• The Factors of Graphs
• Title not available (Why is that?)
• A Note on Tutte's Paper “The Factorization of Linear Graphs”^*

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Spanning subgraphs with specified valencies. (Reprint)

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