Degree sequences of matrogenic graphs
From MaRDI portal
Publication:797597
DOI10.1016/0012-365X(84)90023-2zbMATH Open0545.05054OpenAlexW2036789425MaRDI QIDQ797597FDOQ797597
Authors: Paola Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90023-2
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Properties of Graphs with Multiple Edges
- The splittance of a graph
- Matroidal graphs
- Threshold Sequences
- Title not available (Why is that?)
- Class of graphs with restricted neighborhoods
- Graphs and degree sequences: Canonical decomposition
Cited In (16)
- Threshold graphs and synchronization protocols
- On realization graphs of degree sequences
- Title not available (Why is that?)
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- Title not available (Why is that?)
- \(\lambda\)-coloring matrogenic graphs
- Once more on matrogenic graphs
- Hereditary unigraphs and Erdős-Gallai equalities
- Graphs and degree sequences. I
- The principal Erdős-Gallai differences of a degree sequence
- Minimal forbidden sets for degree sequence characterizations
- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
- Forcibly bipartite and acyclic (uni-)graphic sequences
- Title not available (Why is that?)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs
- On 2-switches and isomorphism classes
This page was built for publication: Degree sequences of matrogenic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797597)
