The following pages link to On minimally \(b\)-imperfect graphs (Q967413):
Displayed 10 items.
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- On b-perfect chordal graphs (Q1043818) (← links)
- The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
- A characterization of edge \(b\)-critical graphs (Q1701125) (← links)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- A Characterization of b-Perfect Graphs (Q2911056) (← links)