scientific article

zbMath0452.05025MaRDI QIDQ3898517

William Staton

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

independent setchromatic numberregular graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (23)

On the chromatic vertex stability number of graphs ⋮ Problems and results on judicious partitions ⋮ On parsimonious edge-colouring of graphs with maximum degree three ⋮ On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs ⋮ Parsimonious edge coloring ⋮ Critical graphs for the chromatic edge-stability number ⋮ Maximum directed cuts in graphs with degree constraints ⋮ When removing an independent set is optimal for reducing the chromatic number ⋮ A Gallai’s Theorem type result for the edge stability of graphs ⋮ On the chromatic edge stability index of graphs ⋮ On the vertex stability numbers of graphs ⋮ On critical graphs for the chromatic edge-stability number ⋮ Tight bounds on the chromatic edge stability index of graphs ⋮ On the chromatic edge stability number of graphs ⋮ Triangle-free subcubic graphs with minimum bipartite density ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number ⋮ The bipartite edge frustration of extension of splice and link graphs ⋮ Bipartite subgraphs of triangle-free subcubic graphs ⋮ Maximum bipartite subgraphs of cubic triangle-free planar graphs ⋮ On the \(\rho \)-edge stability number of graphs ⋮ Bipartite density of triangle-free subcubic graphs ⋮ Judicious partitions of bounded‐degree graphs ⋮ SOME EXTREMAL RESULTS ON THE CHROMATIC STABILITY INDEX

This page was built for publication: