Spanning subgraphs with specified valencies
From MaRDI portal
Publication:1844690
DOI10.1016/0012-365X(74)90075-2zbMATH Open0284.05123MaRDI QIDQ1844690FDOQ1844690
Authors: William T. Tutte 
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Title not available (Why is that?)
- Parallel concepts in graph theory
- 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 (14)
- Editing graphs to satisfy degree constraints: a parameterized approach
- Matching theory -- a sampler: From Dénes König to the present
- f-factors and related decompositions of graphs
- On Petersen's graph theorem
- Subgraphs and their degree sequences of a digraph
- Graph factors
- A Short Proof of Ore’s f-Factor Theorem Using Flows
- On f-factors of a graph
- An extension of Tutte's 1-factor theorem
- Characterization of self-complementary graphs with 2-factors
- Minimum degree, independence number and regular factors
- Graph factors and factorization: 1985--2003: a survey
- Parity results on connected f-factors
- Graph editing problems with extended regularity constraints
This page was built for publication: Spanning subgraphs with specified valencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844690)
