Decomposition of graphical sequences and unigraphs
From MaRDI portal
Publication:1567622
DOI10.1016/S0012-365X(99)00381-7zbMath0944.05025OpenAlexW2062663490MaRDI QIDQ1567622
Publication date: 15 September 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00381-7
Related Items (35)
Split graphs ⋮ On realization graphs of degree sequences ⋮ Split graphs and Nordhaus-Gaddum graphs ⋮ The A4-structure of a graph ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graph isomorphism, color refinement, and compactness ⋮ Neighborhood degree lists of graphs ⋮ \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs ⋮ Hereditary unigraphs and Erdős-Gallai equalities ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ On the Power of Color Refinement ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ On fractional realizations of graph degree sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ On 2-switches and isomorphism classes ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Adjacency relationships forced by a degree sequence ⋮ Operator decomposition of graphs and the reconstruction conjecture ⋮ The \(L(2,1)\)-labeling of unigraphs ⋮ Antimagic labeling and canonical decomposition of graphs ⋮ Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) ⋮ Half-graphs, other non-stable degree sequences, and the switch Markov chain ⋮ Havel-Hakimi residues of unigraphs ⋮ Split digraphs ⋮ The principal Erdős-Gallai differences of a degree sequence ⋮ Cliques in realization graphs ⋮ Operator Decomposition of Graphs and the Reconstruction Conjecture ⋮ Relaxed and approximate graph realizations
This page was built for publication: Decomposition of graphical sequences and unigraphs
