Pages that link to "Item:Q1849931"

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

Displaying 49 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)
• On \(b\)-chromatic number with other types of chromatic numbers on double star graphs (Q480426) (← 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)
• 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)
• 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)
• \(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)
• Bounds for the b-chromatic number of some families of graphs (Q2488938) (← links)
• On Grundy and b-chromatic number of some families of graphs: a comparative study (Q2657109) (← 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)
• The b-Chromatic Number of Some Standard Graphs (Q3296845) (← links)
• The b-chromatic number of power graphs of complete caterpillars (Q3379157) (← links)
• About the b-continuity of graphs (Q3439146) (← links)
• On b-vertex and b-edge critical graphs (Q3459012) (← links)
• Exact values for the<i>b</i>-chromatic number of a power complete<i>k</i>-ary tree (Q4678480) (← links)
• Generalised colouring sums of graphs (Q4966732) (← links)
• The study of the b-choromatic number of some classes of fractal graphs (Q5043910) (← links)
• A Note on<i>b-</i>Coloring of Fan Graphs (Q5069654) (← links)
• The<i>b</i>-chromatic number of certain graphs and digraphs (Q5069792) (← links)
• (Q5071864) (← links)
• Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas (Q6551192) (← links)
• On neighborhood \(b\)-pseudo chromatic number of graphs (Q6650652) (← links)