The following pages link to The b-chromatic number of a graph (Q1283791):
Displaying 50 items.
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
- \(b\)-continuity and the lexicographic product of graphs (Q324755) (← links)
- The \(b\)-chromatic number of powers of hypercube (Q327695) (← links)
- Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs (Q339486) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Bounds for the \(b\)-chromatic number of \(G-v\) (Q385136) (← links)
- The \(b\)-chromatic number of regular graphs via the edge-connectivity (Q393940) (← links)
- \(b\)-colouring outerplanar graphs with large girth (Q418884) (← links)
- On the \(b\)-chromatic number of regular graphs without 4-cycle (Q427905) (← links)
- On edge-\(b\)-critical graphs (Q476322) (← links)
- The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335) (← links)
- On \(b\)-chromatic number with other types of chromatic numbers on double star graphs (Q480426) (← links)
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
- The achromatic number of Kneser graphs (Q510596) (← links)
- Graphs with large girth are \(b\)-continuous (Q510951) (← links)
- On the b-coloring of tight graphs (Q512879) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- On \(b\)-coloring of powers of hypercubes (Q528557) (← links)
- Recolouring-resistant colourings (Q548277) (← links)
- The b-chromatic number of cubic graphs (Q604658) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- Color chain of a graph (Q659728) (← links)
- The \(b\)-chromatic index of a graph (Q745926) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- \(b\)-coloring of Kneser graphs (Q765331) (← links)
- b-coloring of some powers of hypercubes (Q831729) (← links)
- About \(b\)-coloring of windmill graph (Q893453) (← links)
- On \(b\)-chromatic number of Sun let graph and wheel graph families (Q895157) (← links)
- On quasi-monotonous graphs (Q897599) (← links)
- On minimally \(b\)-imperfect graphs (Q967413) (← links)
- On the b-chromatic number of Kneser graphs (Q968135) (← links)
- Fall colouring of bipartite graphs and Cartesian products of graphs (Q1003677) (← links)
- On \(b\)-colorings in regular graphs (Q1026139) (← links)
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- On b-perfect chordal graphs (Q1043818) (← links)
- On \(b\)-coloring of the Kneser graphs (Q1043965) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
- The \(b\)-continuity of graphs with large girth (Q1684929) (← links)
- On the \(b\)-continuity of the lexicographic product of graphs (Q1684933) (← links)
- A characterization of \(b_e\)-critical trees (Q1700040) (← links)
- A characterization of edge \(b\)-critical graphs (Q1701125) (← links)
- Edge-\(b\)-coloring trees (Q1702122) (← links)
- On the \(b\)-chromatic number of Cartesian products (Q1706119) (← links)
- On the \(b\)-domatic number of graphs (Q1717183) (← links)
- Graphs with small fall-spectrum (Q1720325) (← links)
- A note on \(b\)-coloring of Kneser graphs (Q1730264) (← links)
