Critically indecomposable graphs

DOI10.1016/j.dam.2008.05.003zbMath1228.05271OpenAlexW2055427560MaRDI 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

zbMATH Keywords

commutative elimination sequencecritical indecomposabilityindecomposable graphsprimitive 2-structures

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Critically indecomposable graphs