A simple existence criterion for (g
From MaRDI portal
DOI10.1016/0012-365X(90)90387-WzbMATH Open0723.05101OpenAlexW2082659364WikidataQ56688017 ScholiaQ56688017MaRDI QIDQ757439FDOQ757439
Authors: Katherine Heinrich, Pavol Hell, David Kirkpatrick, Guizhen Liu 
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90387-w
Recommendations
Cites Work
- Matching theory
- The Factorization of Linear Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Graph factors
- Subgraphs with prescribed valencies
- An algorithmic proof of Tutte's f-factor theorem
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- A remark on the factor theorems of lovász and tutte
- The Subgraph Problem
- [a,b]-factors of graphs
- An extension of Tutte's 1-factor theorem
- Title not available (Why is that?)
- Simplified existence theorems for \((g,f)\)-factors
Cited In (31)
- Ryser's theorem for \(\rho\)-Latin rectangles
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- Orthogonal (g, f)-factorizations in networks
- A Note on the Existence of All (g,f)-Factors
- Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs
- An algorithmic proof of Tutte's f-factor theorem
- Relaxed and approximate graph realizations
- Title not available (Why is that?)
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
- Subgraphs with orthogonal factorizations and algorithms
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
- Solving matching problems efficiently in bipartite graphs
- Graph realizations: maximum degree in vertex neighborhoods
- Fractional factors, component factors and isolated vertex conditions in graphs
- Nontrivial path covers of graphs: existence, minimization and maximization
- Some Results on Fractional Graph Theory
- Degree constrained subgraphs
- Constructive proof of deficiency theorem of \((g,f)\)-factor
- Overlaying a hypergraph with a graph with bounded maximum degree
- How many matchings cover the nodes of a graph?
- Randomly orthogonal \((g,f)\)-factorizations in graphs
- Simplified existence theorems on all fractional \([a,b]\)-factors
- Factors of trees
- Toughness of graphs and \([2,b]\)-factors
- Fractional factors and component factors in graphs with isolated toughness smaller than 1
- Simplified existence theorems for \((g,f)\)-factors
- Graph factors and factorization: 1985--2003: a survey
- Some problems on factorizations with constraints in bipartite graphs
- Efficiently realizing interval sequences
- \((a,b,k)\)-critical graphs
- Title not available (Why is that?)
This page was built for publication: A simple existence criterion for \((g<f)\)-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757439)
