Decomposition of graphical sequences and unigraphs
From MaRDI portal
Publication:1567622
DOI10.1016/S0012-365X(99)00381-7zbMath0944.05025MaRDI 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
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, Unnamed Item, Unnamed Item, Forcibly bipartite and acyclic (uni-)graphic sequences, Graph realizations: maximum degree in vertex neighborhoods, On realization graphs of degree sequences, Split graphs and Nordhaus-Gaddum graphs, \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs, Hereditary unigraphs and Erdős-Gallai equalities, On fractional realizations of graph degree sequences, On 2-switches and isomorphism classes, Havel-Hakimi residues of unigraphs, Split digraphs, Operator decomposition of graphs and the reconstruction conjecture, Antimagic labeling and canonical decomposition of graphs, The switch Markov chain for sampling irregular graphs and digraphs, Adjacency relationships forced by a degree sequence, Split graphs, Half-graphs, other non-stable degree sequences, and the switch Markov chain, The principal Erdős-Gallai differences of a degree sequence, Cliques in realization graphs, Relaxed and approximate graph realizations, The \(L(2,1)\)-labeling of unigraphs, Graph isomorphism, color refinement, and compactness, Neighborhood degree lists of graphs, On vertex-weighted realizations of acyclic and general graphs, The A4-structure of a graph, On the Power of Color Refinement, Pairwise Compatibility Graphs: A Survey, Operator Decomposition of Graphs and the Reconstruction Conjecture, Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
