Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem

DOI10.1002/JGT.23017zbMath1529.05097arXiv2204.04299OpenAlexW4385501986WikidataQ121809301 ScholiaQ121809301MaRDI QIDQ6142661

James M. Shook

Publication date: 4 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.04299

zbMATH Keywords

regular graphperfect matchingedge-connectivitydegree sequence\(k\)-factor

Mathematics Subject Classification ID

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

Related Items (1)

On a conjecture that strengthens Kundu's \(k\)-factor theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• \(k\) -factors in regular graphs
• On graphs with equal edge connectivity and minimum degree
• On graphs with equal edge-connectivity and minimum degree
• Generalizations of the k-factor theorem
• Degree sequence conditions for maximally edge-connected graphs depending on the clique number
• Factorizing regular graphs
• Regular factors in regular graphs
• On the existence of super edge-connected graphs with prescribed degrees
• Graph Theory
• Packing of graphic n-tuples
• Regular factors of regular graphs
• A Note onn-Edge-Connectivity
• Multi-switch: A tool for finding potential edge-disjoint 1-factors
• Regular Graphs of High Degree are 1-Factorizable
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Highly edge‐connected regular graphs without large factorizable subgraphs

This page was built for publication: Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem