scientific article; zbMATH DE number 3706475
From MaRDI portal
Publication:3898517
Cited in
(25)- Maximum bipartite subgraphs of cubic triangle-free planar graphs
- Bipartite density of triangle-free subcubic graphs
- On the chromatic edge stability number of graphs
- Parsimonious edge coloring
- Maximum directed cuts in graphs with degree constraints
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
- On the \(\rho \)-edge stability number of graphs
- On the chromatic vertex stability number of graphs
- Critical graphs for the chromatic edge-stability number
- On parsimonious edge-colouring of graphs with maximum degree three
- Triangle-free subcubic graphs with minimum bipartite density
- Bipartite subgraphs of triangle-free subcubic graphs
- On critical graphs for the chromatic edge-stability number
- Judicious partitions of bounded‐degree graphs
- Problems and results on judicious partitions
- On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs
- Some extremal results on the chromatic stability index
- 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
- Tight bounds on the chromatic edge stability index of graphs
- Monotonic decompositions of submodular set functions
- On the chromatic edge stability index of planar and regular graphs
- The bipartite edge frustration of extension of splice and link graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898517)
