The following pages link to (Q4414507):
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)
- 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)
- 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)
- Graphs with large girth are \(b\)-continuous (Q510951) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← 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 survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← 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)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← 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)
- On \(b\)-colorings in regular graphs (Q1026139) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- On b-perfect chordal graphs (Q1043818) (← 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)
- A characterization of \(b_e\)-critical trees (Q1700040) (← links)
- Edge-\(b\)-coloring trees (Q1702122) (← links)
- On the \(b\)-chromatic number of Cartesian products (Q1706119) (← links)
- Graphs with small fall-spectrum (Q1720325) (← links)
- A note on \(b\)-coloring of Kneser graphs (Q1730264) (← links)
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- On approximating the b-chromatic number (Q1765381) (← links)
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
- A note on approximating the \(b\)-chromatic number (Q1949121) (← links)
- \(b\)-chromatic number of Cartesian product of some families of graphs (Q2014703) (← links)
- \(b\)-coloring of the Mycielskian of some classes of graphs (Q2118233) (← links)
- Graphs with girth at least 8 are b-continuous (Q2132404) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130) (← links)
- On the \(b\)-chromatic number of regular graphs (Q2275938) (← links)
- A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
- Graphs of girth at least 7 have high \(b\)-chromatic number (Q2346588) (← links)
- The \(b\)-chromatic index of graphs (Q2352073) (← links)
