scientific article; zbMATH DE number 1953103
From MaRDI portal
Publication:4414507
zbMath1024.05026MaRDI QIDQ4414507
Zsolt Tuza, Jan Kratochvíl, Margit Voigt
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730310.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (74)
A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ Coloring problems on bipartite graphs of small diameter ⋮ 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 ⋮ A Note onb-Coloring of Fan Graphs ⋮ 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 ⋮ \((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\)-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 ⋮ Upper and lower bounds based on linear programming for the b-coloring problem ⋮ On quasi-monotonous graphs ⋮ On b-acyclic chromatic number of a graph ⋮ \(b\)-colouring outerplanar graphs with large girth ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ A characterization of \(b_e\)-critical trees ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width ⋮ On the \(b\)-chromatic number of regular graphs without 4-cycle ⋮ 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 \(b\)-chromatic number of Cartesian products ⋮ \(b\)-chromatic numbers of powers of paths and cycles ⋮ Graphs with small fall-spectrum ⋮ Maximization coloring problems on graphs with few \(P_4\) ⋮ 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 ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic ⋮ Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs ⋮ Graphs with large girth are \(b\)-continuous ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ \(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 ⋮ On the \(b\)-chromatic number of regular graphs ⋮ The \(b\)-chromatic index of a graph ⋮ \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ⋮ A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs ⋮ On \(b\)-colorings in regular graphs ⋮ A complexity dichotomy for critical values of the b-chromatic number of 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 ⋮ Some results on the b-chromatic number in complementary prism graphs ⋮ On the b-coloring of cographs and \(P_{4}\)-sparse graphs ⋮ On b-perfect chordal graphs ⋮ Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs ⋮ 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
This page was built for publication:
