Critical graphs with connected complements
From MaRDI portal
Publication:1417962
DOI10.1016/S0095-8956(03)00069-8zbMath1031.05053OpenAlexW2095384119WikidataQ29396198 ScholiaQ29396198MaRDI QIDQ1417962
Publication date: 6 January 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00069-8
Related Items (12)
Bounded clique cover of some sparse graphs ⋮ A generalisation of matching and colouring ⋮ Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four ⋮ Point partition numbers: decomposable and indecomposable critical graphs ⋮ Minimal connected \(\tau\)-critical hypergraphs ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ On \(\chi \)-diperfect digraphs with stability number two ⋮ Complete graph immersions in dense graphs ⋮ The chromatic gap and its extremes ⋮ Minors in Graphs with High Chromatic Number ⋮ Hajós and Ore constructions for digraphs ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces
Cites Work
This page was built for publication: Critical graphs with connected complements
