Pages that link to "Item:Q1815327"
From MaRDI portal
The following pages link to A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (Q1815327):
Displaying 6 items.
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- Backbone colorings of graphs with bounded degree (Q968172) (← links)
- Odd connection and odd vertex-connection of graphs (Q1800421) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- Dichotomy for Coloring of Dart Graphs (Q3000496) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
