Pages that link to "Item:Q1849931"

The following pages link to Some bounds for the \(b\)-chromatic number of a graph (Q1849931):

Displaying 50 items.

• The \(b\)-chromatic number of powers of hypercube (Q327695) (← links)
• Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs (Q339486) (← links)
• Bounds for the \(b\)-chromatic number of \(G-v\) (Q385136) (← links)
• On the \(b\)-chromatic number of regular graphs without 4-cycle (Q427905) (← links)
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
• On \(b\)-chromatic number with other types of chromatic numbers on double star graphs (Q480426) (← links)
• \(b\)-coloring of Cartesian product of trees (Q514975) (← 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)
• A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
• \([r,s,t]\)-colorings of graph products (Q742628) (← links)
• A bound on the chromatic number of an almost planar graph (Q744556) (← links)
• The \(b\)-chromatic index of a graph (Q745926) (← links)
• \(b\)-coloring of Kneser graphs (Q765331) (← links)
• Thinness of product graphs (Q831864) (← links)
• About \(b\)-coloring of windmill graph (Q893453) (← links)
• On \(b\)-chromatic number of Sun let graph and wheel graph families (Q895157) (← 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)
• A graph b-coloring framework for data clustering (Q1040797) (← links)
• On b-perfect chordal graphs (Q1043818) (← links)
• On \(b\)-coloring of the Kneser graphs (Q1043965) (← links)
• A bound on the total chromatic number (Q1297726) (← links)
• The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
• Edge-\(b\)-coloring trees (Q1702122) (← links)
• On the \(b\)-chromatic number of Cartesian products (Q1706119) (← links)
• On approximating the b-chromatic number (Q1765381) (← links)
• Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
• On bounding the chromatic number of L-graphs (Q1918550) (← links)
• \(b\)-colouring the Cartesian product of trees and some other graphs (Q1941393) (← 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)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• On the \(b\)-chromatic number of regular graphs (Q2275938) (← links)
• The \(b\)-chromatic index of direct product of graphs (Q2352788) (← links)
• Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement (Q2434725) (← links)
• \(b\)-chromatic numbers of powers of paths and cycles (Q2444545) (← links)
• A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
• Bounds for the b-chromatic number of some families of graphs (Q2488938) (← links)
• Chromatic number versus chromatic number in graphs with bounded clique number (Q2640609) (← links)
• On Grundy and b-chromatic number of some families of graphs: a comparative study (Q2657109) (← links)
• \(b\)-chromatic sum of a graph (Q2788715) (← links)
• \(b\)-chromatic number of complement of some graphs (Q2801007) (← links)
• On lower bounds for the \(b\)-chromatic number of connected bipartite graphs (Q2840743) (← links)
• Bounds for the \(b\)-chromatic number of vertex-deleted subgraphs and the extremal graphs (Q2851488) (← links)
• On \(b\)-coloring of Cartesian product of graphs. (Q2864479) (← links)
• Upper bounds on the \(b\)-chromatic number and results for restricted graph classes (Q2906356) (← links)