Some Algorithms on Conditionally Critical Indecomposable Graphs

DOI10.1016/J.ENDM.2005.06.043MaRDI QIDQ3439358zbMATH OpenOpenAlexFDO

Authors 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

3-coloringcriticalityindecomposable graphsperfect matching

Mathematics Subject Classification ID

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

Cites work

• \(P_ 4\)-trees and substitution decomposition
• Computing and Combinatorics
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• scientific article; zbMATH DE number 1222840 (Why is no real title available?)
• scientific article; zbMATH DE number 512932 (Why is no real title available?)
• Indecomposable graphs
• Introduction to algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439358)