The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
DOI10.1016/S0024-3795(98)10229-XzbMATH Open0932.05023MaRDI QIDQ1300907FDOQ1300907
Authors: S. R. Arikati, Uri N. Peled 
Publication date: 13 March 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
degree sequencethreshold graphrealization graphthreshold sequencecycle exchangeHamilton graphmajorization gap
Graph theory (including graph drawing) in computer science (68R10) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Inequalities: theory of majorization and its applications
- Threshold graphs and related topics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrices of zeros and ones with fixed row and column sum vectors
- Parallel concepts in graph theory
- Hamiltonicity of a type of interchange graphs
- Some Properties of Graphs with Multiple Edges
- The splittance of a graph
- Extreme degree sequences of simple graphs
- The polytope of degree sequences
- Title not available (Why is that?)
- Threshold Sequences
- Matroid basis graphs. I
- Matroid basis graphs. II
- Degree sequences and majorization
- On a conjecture of wang and williams
- Title not available (Why is that?)
- The threshold weight of a graph
Cited In (6)
This page was built for publication: The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300907)
