Split graphs and Nordhaus-Gaddum graphs

DOI10.1016/j.disc.2016.04.001zbMath1338.05046arXiv1506.03746OpenAlexW2963206482MaRDI QIDQ297938

Karen L. Collins, Christine T. Cheng, Ann N. Trenk

Publication date: 20 June 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

split graphsdegree sequence characterizationNG-graphsNordhaus-Gaddum theorempseudo-split graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (4)

Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Split graphs and block representations ⋮ Finding balance: split graphs and related classes ⋮ Split graphs: combinatorial species and asymptotics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hereditary unigraphs and Erdős-Gallai equalities
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• On fractional realizations of graph degree sequences
• Covering a set by subsets
• The splittance of a graph
• Linear recognition of pseudo-split graphs
• Decomposition of graphical sequences and unigraphs
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• Complementary graphs and the chromatic number
• On Complementary Graphs

This page was built for publication: Split graphs and Nordhaus-Gaddum graphs