The b-chromatic number of a graph
From MaRDI portal
Publication:1283791
DOI10.1016/S0166-218X(98)00146-2zbMath0933.05051MaRDI QIDQ1283791
David F. Manlove, Robert W. Irving
Publication date: 16 December 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (only showing first 100 items - show all)
A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ b-coloring of some powers of hypercubes ⋮ The study of the b-choromatic number of some classes of fractal graphs ⋮ Graphs with girth at least 8 are b-continuous ⋮ On the \(b\)-continuity property of graphs ⋮ On b-vertex and b-edge critical graphs ⋮ \(b\)-continuity and the lexicographic product of graphs ⋮ The \(b\)-chromatic number of powers of hypercube ⋮ A Note onb-Coloring of Fan Graphs ⋮ Theb-chromatic number of certain graphs and digraphs ⋮ Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs ⋮ On the parameterized complexity of b-\textsc{chromatic number} ⋮ On Grundy and b-chromatic number of some families of graphs: a comparative study ⋮ The b-chromatic number of cubic graphs ⋮ Bounds for the \(b\)-chromatic number of \(G-v\) ⋮ The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity ⋮ \(b\)-chromatic sum of Mycielskian of paths ⋮ On the thinness and proper thinness of a graph ⋮ \((N, p)\)-equitable \(b\)-coloring of graphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ The \(b\)-chromatic number of regular graphs via the edge-connectivity ⋮ \(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ The \(b\)-continuity of graphs with large girth ⋮ On the \(b\)-continuity of the lexicographic product of graphs ⋮ On the \(b\)-coloring of \(P_{4}\)-tidy graphs ⋮ An integer programming approach to b-coloring ⋮ About \(b\)-coloring of windmill graph ⋮ On \(b\)-chromatic number of Sun let graph and wheel graph families ⋮ On quasi-monotonous graphs ⋮ On b-acyclic chromatic number of a graph ⋮ \(b\)-colouring outerplanar graphs with large girth ⋮ A new vertex coloring heuristic and corresponding chromatic number ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ A characterization of \(b_e\)-critical trees ⋮ On the \(b\)-chromatic number of regular graphs without 4-cycle ⋮ A characterization of edge \(b\)-critical graphs ⋮ Edge-\(b\)-coloring trees ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ A note on approximating the \(b\)-chromatic number ⋮ Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement ⋮ On the Grundy and \(b\)-chromatic numbers of a graph ⋮ On the \(b\)-chromatic number of Cartesian products ⋮ New Steiner 2-designs from old ones by paramodifications ⋮ \(b\)-chromatic numbers of powers of paths and cycles ⋮ On the \(b\)-domatic number of graphs ⋮ Graphs with small fall-spectrum ⋮ Maximization coloring problems on graphs with few \(P_4\) ⋮ A characterization of claw-free \(b\)-perfect graphs ⋮ On edge-\(b\)-critical graphs ⋮ Color chain of a graph ⋮ The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs ⋮ A note on \(b\)-coloring of Kneser graphs ⋮ On \(b\)-chromatic number with other types of chromatic numbers on double star graphs ⋮ The b-Chromatic Number of Some Standard Graphs ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic ⋮ A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming ⋮ Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs ⋮ New bounds for the \(b\)-chromatic number of vertex deleted graphs ⋮ The achromatic number of Kneser graphs ⋮ Graphs with large girth are \(b\)-continuous ⋮ On the b-coloring of tight graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ On \(b\)-coloring of powers of hypercubes ⋮ \(b\)-coloring of tight graphs ⋮ On minimally \(b\)-imperfect graphs ⋮ On the b-chromatic number of Kneser graphs ⋮ Unnamed Item ⋮ On approximating the b-chromatic number ⋮ Recolouring-resistant colourings ⋮ Bounds for the b-chromatic number of some families of graphs ⋮ \(b\)-chromatic number of Cartesian product of some families of graphs ⋮ Exact values for theb-chromatic number of a power completek-ary tree ⋮ On the \(b\)-chromatic number of regular graphs ⋮ Fall colouring of bipartite graphs and Cartesian products of graphs ⋮ The b-chromatic number of power graphs of complete caterpillars ⋮ Generalised colouring sums of graphs ⋮ The \(b\)-chromatic index of a graph ⋮ \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ⋮ Certain chromatic sums of some cycle-related graph classes ⋮ A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs ⋮ On \(b\)-colorings in regular graphs ⋮ \(b\)-coloring of Kneser graphs ⋮ b-coloring of m-tight graphs ⋮ b-chromatic number of cacti ⋮ On lower bounds for the b-chromatic number of connected bipartite graphs ⋮ A graph b-coloring framework for data clustering ⋮ On the b-coloring of cographs and \(P_{4}\)-sparse graphs ⋮ On b-perfect chordal graphs ⋮ On \(b\)-coloring of the Kneser graphs ⋮ Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs ⋮ On the \(b\)-dominating coloring of graphs ⋮ Achromatic numbers of Kneser graphs ⋮ On the \(b\)-coloring of \(G - e\) ⋮ Graphs of girth at least 7 have high \(b\)-chromatic number ⋮ About the b-continuity of graphs ⋮ The \(b\)-chromatic index of graphs ⋮ The \(b\)-chromatic index of direct product of graphs ⋮ On the \(b\)-chromatic number of regular bounded graphs ⋮ \(b\)-coloring of the Mycielskian of some classes of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the minimum maximal independence number
- On approximating the minimum independent dominating set
- On the computational complexity of upper fractional domination
- Concerning the achromatic number of graphs
- Some perfect coloring properties of graphs
- Achromatic number is NP-complete for cographs and interval graphs
- Maximum versus minimum invariants for graphs
- Edge Dominating Sets in Graphs
- The achromatic number of a graph
This page was built for publication: The b-chromatic number of a graph
