The following pages link to (Q3898517):
Displaying 23 items.
- The bipartite edge frustration of extension of splice and link graphs (Q988725) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- On the chromatic edge stability number of graphs (Q1756117) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (Q2011157) (← links)
- On the \(\rho \)-edge stability number of graphs (Q2062684) (← links)
- On the chromatic vertex stability number of graphs (Q2122687) (← links)
- Critical graphs for the chromatic edge-stability number (Q2174589) (← links)
- On parsimonious edge-colouring of graphs with maximum degree three (Q2376086) (← links)
- Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- On critical graphs for the chromatic edge-stability number (Q2689481) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs (Q5054777) (← links)
- SOME EXTREMAL RESULTS ON THE CHROMATIC STABILITY INDEX (Q5867853) (← links)
- When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
- A Gallai’s Theorem type result for the edge stability of graphs (Q6063845) (← links)
- On the chromatic edge stability index of graphs (Q6116405) (← links)
- On the vertex stability numbers of graphs (Q6180560) (← links)
- Tight bounds on the chromatic edge stability index of graphs (Q6197718) (← links)
