Graph classes characterized both by forbidden subgraphs and degree sequences
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- On forcibly connected graphic sequences
- Adjacency relationships forced by a degree sequence
- Graphs G for which G and \(\bar G\) are both semidecomposable
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- The feasibility problem for line graphs
- Minimal forbidden sets for degree sequence characterizations
- A note on graphic sequences with no realization containing an induced four cycle
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
- New results on degree sequences of uniform hypergraphs
- Forbidding and enforcing on graphs
- On 2-switches and isomorphism classes
- Characterization of hereditary unigraphs based on canonical decomposition
- Non-minimal degree-sequence-forcing triples
- The study of the b-choromatic number of some classes of fractal graphs
- Forbidden subgraphs generating almost the same sets
- scientific article; zbMATH DE number 2192215 (Why is no real title available?)
- Forcibly bipartite and acyclic (uni-)graphic sequences
This page was built for publication: Graph classes characterized both by forbidden subgraphs and degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441407)