Graphic Sequences Have Realizations Containing Bisections of Large Degree

DOI10.1002/JGT.20652MaRDI QIDQ4650188zbMATH OpenOpenAlexFDO

Authors Stephen G. Hartke, Tyler Seacrest

Publication date 23 November 2012

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

Full work available at URL https://doi.org/10.1002/jgt.20652

zbMATH Keywords

1-factor\(k\)-factorbisectiondegree sequence

Mathematics Subject Classification ID

Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Graphic sequences that have a realization with large clique number
• scientific article; zbMATH DE number 5734066
• Sufficient conditions for graphicality of bidegree sequences
• Graphic sequences with a realization containing a complete multipartite subgraph
• Graphic sequences with an \(A\)-connected realization
• Constructive extensions of two results on graphic sequences
• scientific article; zbMATH DE number 68911
• Graphic sequences and split graphs
• A sufficient condition for a pair of sequences to be bipartite graphic
• On multigraphic and potentially multigraphic sequences

Cites work

• A short proof of Kundu's k-factor theorem
• Algorithms for constructing graphs and digraphs with given valences and factors
• scientific article; zbMATH DE number 3710225 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Problems and results on judicious partitions
• Regular spanning subgraphs of bipartite graphs of high minimum degree
• The k-factor conjecture is true

Cited in

(5)

• On problems about judicious bipartitions of graphs
• Stability of the potential function
• On balanced bipartitions of graphs
• Weak external bisections of regular graphs
• On a conjecture that strengthens Kundu's k-factor theorem

This page was built for publication: Graphic Sequences Have Realizations Containing Bisections of Large Degree

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