Minimum degree of bipartite graphs and the existence of k-factors
From MaRDI portal
Publication:757438
DOI10.1007/BF01787577zbMATH Open0723.05098OpenAlexW2042847307MaRDI QIDQ757438FDOQ757438
Authors: P. Katerinis 
Publication date: 1990
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01787577
Recommendations
- Minimum degree of a graph and the existence of k-factors
- scientific article; zbMATH DE number 1839841
- scientific article; zbMATH DE number 1467781
- scientific article; zbMATH DE number 1780075
- Minimum \(k\)-critical bipartite graphs
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
- Connected \(k\)-factors in bipartite graphs
- Extremal bipartite graphs with a unique k-factor
- scientific article; zbMATH DE number 1191210
- A sufficient condition for a bipartite graph to have a k‐factor
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (12)
- Extensions to 2-factors in bipartite graphs
- A short proof of Kundu's k-factor theorem
- Eigenvalues and [a,b]‐factors in regular graphs
- Title not available (Why is that?)
- Bipartite toughness and \(k\)-factors in bipartite graphs
- Matching extension and minimum degree
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sufficient condition for a bipartite graph to have a k‐factor
- Graph factors and factorization: 1985--2003: a survey
- Minimum degree of a graph and the existence of k-factors
- Connected \(k\)-factors in bipartite graphs
This page was built for publication: Minimum degree of bipartite graphs and the existence of k-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757438)
