Some Algorithms on Conditionally Critical Indecomposable Graphs

DOI10.1016/j.endm.2005.06.043zbMath1200.05225OpenAlexW2088816816MaRDI QIDQ3439358

Shashank K. Mehta, Chandan K. Dubey

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.043

zbMATH Keywords

criticality3-coloringperfect matchingindecomposable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• \(P_ 4\)-trees and substitution decomposition
• Indecomposable graphs
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Computing and Combinatorics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Algorithms on Conditionally Critical Indecomposable Graphs