Non-minimal degree-sequence-forcing triples
From MaRDI portal
Publication:497308
DOI10.1007/s00373-014-1450-0zbMath1327.05284OpenAlexW2061159553MaRDI QIDQ497308
Mohit Kumbhat, Michael D. Barrus, Stephen G. Hartke
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1450-0
forbidden subgraphsdegree sequence characterization2-switchdegree-sequence-forcing setforcibly \(P\)-graphicpotentially \(P\)-graphic
Related Items (4)
Hereditary unigraphs and Erdős-Gallai equalities ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ On 2-switches and isomorphism classes ⋮ Minimal forbidden sets for degree sequence characterizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- The splittance of a graph
- Linear recognition of pseudo-split graphs
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- Characterizing forbidden clawless triples implying Hamiltonian graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Minimal forbidden sets for degree sequence characterizations
- Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
- A Note on Unigraphic Sequences
- Forbidden triples implying Hamiltonicity: for all graphs
- Some Properties of Graphs with Multiple Edges
- Graph classes characterized both by forbidden subgraphs and degree sequences
This page was built for publication: Non-minimal degree-sequence-forcing triples