The following pages link to \(b\)-coloring of tight graphs (Q1759847):
Displaying 23 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)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Graphs with large girth are \(b\)-continuous (Q510951) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← 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)
- Edge-\(b\)-coloring trees (Q1702122) (← links)
- Graphs with small fall-spectrum (Q1720325) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
- Graphs with girth at least 8 are b-continuous (Q2132404) (← links)
- Well-partitioned chordal graphs (Q2144581) (← 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)
- 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)
- The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity (Q2413181) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- The b-Chromatic Number of Some Standard Graphs (Q3296845) (← links)
- (Q5071864) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
