On prime inductive classes of graphs
From MaRDI portal
Publication:648987
DOI10.1016/J.EJC.2011.05.001zbMATH Open1229.05236OpenAlexW2060578913MaRDI QIDQ648987FDOQ648987
Authors: Ewa Drgas-Burchardt 
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.05.001
Recommendations
Cites Work
- Geometric algorithms and combinatorial optimization
- Extension of hereditary classes with substitutions
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Title not available (Why is that?)
- Transitiv orientierbare Graphen
- A tree representation for \(P_ 4\)-sparse graphs
- Dominating subgraphs in graphs with some forbidden structures
- Title not available (Why is that?)
- On the closure of graphs under substitution
- Inductive classes of bipartite cubic graphs
- Minimal forbidden graphs of reducible additive hereditary graph properties.
Cited In (9)
- Forbidden graphs for classes of split-like graphs
- Some switching invariant prime graphs
- Prime ideals in the lattice of additive induced-hereditary graph properties
- Extension of hereditary classes with substitutions
- Title not available (Why is that?)
- All minimal prime extensions of hereditary classes of graphs
- Title not available (Why is that?)
- \(\mathcal{P}\)-apex graphs
- Classification of primer hypermaps with a prime number of hyperfaces
This page was built for publication: On prime inductive classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648987)
