scientific article; zbMATH DE number 3674138
From MaRDI portal
Publication:3870938
Cited in
(20)- Graph isomorphism problem
- The switch Markov chain for sampling irregular graphs and digraphs
- Adjacency relationships forced by a degree sequence
- On forcibly hereditary P-graphical sequences
- The principal Erdős-Gallai differences of a degree sequence
- Recognition of split-graphic sequences
- Minimal forbidden sets for degree sequence characterizations
- On realization graphs of degree sequences
- The A₄-structure of a graph
- Hereditary unigraphs and Erdős-Gallai equalities
- New classes of degree sequences with fast mixing swap Markov chain sampling
- scientific article; zbMATH DE number 6963895 (Why is no real title available?)
- scientific article; zbMATH DE number 6963897 (Why is no real title available?)
- Characterization of hereditary unigraphs based on canonical decomposition
- scientific article; zbMATH DE number 7593752 (Why is no real title available?)
- Locating eigenvalues of matrogenic graphs in linear time
- The hereditary closure of the unigraphs
- Havel-Hakimi residues of unigraphs
- Once more on matrogenic graphs
- Antimagic labeling and canonical decomposition of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870938)
