Critically indecomposable graphs
From MaRDI portal
Publication:1003768
DOI10.1016/j.dam.2008.05.003zbMath1228.05271MaRDI QIDQ1003768
Shashank K. Mehta, Chandan K. Dubey
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.003
commutative elimination sequence; critical indecomposability; indecomposable graphs; primitive 2-structures
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Primitivity is hereditary for 2-structures
- \(P_ 4\)-trees and substitution decomposition
- Primitive 2-structures with the \((n-2)\)-property
- Indecomposable graphs
- Graphs indecomposable with respect to the X-join
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- A Fast Algorithm for the Decomposition of Graphs and Posets