Subprime and superprime graphs
From MaRDI portal
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Combinatorial aspects of simplicial complexes (05E45)
Cites work
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- \(P_ 4\)-trees and substitution decomposition
- A note on graphs spanned by Eulerian graphs
- A survey of the algorithmic aspects of modular decomposition
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- Almost all comparability graphs are UPO
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Critically twin primitive 2-structures
- Editing to prime graphs
- Graphs critically without duo
- Graphs indecomposable with respect to the X-join
- scientific article; zbMATH DE number 3916273 (Why is no real title available?)
- scientific article; zbMATH DE number 4066888 (Why is no real title available?)
- scientific article; zbMATH DE number 3720674 (Why is no real title available?)
- scientific article; zbMATH DE number 512932 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- Kneser's conjecture, chromatic number, and homotopy
- Prime orientable graphs
- The composition of graphs
- The spanning subgraphs of eulerian graphs
- Threshold functions
- Transitiv orientierbare Graphen
This page was built for publication: Subprime and superprime graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930346)
