Hereditary unigraphs and Erdős-Gallai equalities

DOI10.1016/j.disc.2013.07.010zbMath1279.05059arXiv1302.2703MaRDI QIDQ389468

Michael D. Barrus

Publication date: 20 January 2014

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

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

zbMATH Keywords

degree sequence; hereditary graph class; chair; Erdős-Gallai inequalities; unigraph

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C07: Vertex degrees

Related Items

Split graphs and Nordhaus-Gaddum graphs, On fractional realizations of graph degree sequences, Adjacency relationships forced by a degree sequence, The principal Erdős-Gallai differences of a degree sequence, Recognition of split-graphic sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 2-switches and isomorphism classes
• Non-minimal degree-sequence-forcing triples
• Degree sequences of matrogenic graphs
• Once more on matrogenic graphs
• The splittance of a graph
• Pairs of sequences with a unique realization by bipartite graphs
• Sequences with a unique realization by simple graphs
• Graphic sequences with unique realization
• Matroidal graphs
• Linear recognition of pseudo-split graphs
• On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
• Decomposition of graphical sequences and unigraphs
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• Threshold graphs and related topics
• Recognition of Unigraphs through Superposition of Graphs
• The A4-structure of a graph
• A Note on Unigraphic Sequences
• Transitiv orientierbare Graphen