Pages that link to "Item:Q2906356"

The following pages link to Upper bounds on the \(b\)-chromatic number and results for restricted graph classes (Q2906356):

Displaying 14 items.

• \(b\)-continuity and the lexicographic product of graphs (Q324755) (← links)
• Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs (Q339486) (← links)
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
• On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
• On the upper and lower chromatic numbers of BSQSs(16) (Q1593852) (← 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)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• New bounds for the \(b\)-chromatic number of vertex deleted graphs (Q2243141) (← links)
• On the \(b\)-continuity property of graphs (Q2381540) (← links)
• Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement (Q2434725) (← links)
• On lower bounds for the \(b\)-chromatic number of connected bipartite graphs (Q2840743) (← links)
• \(b\)-coloring of some bipartite graphs (Q2906843) (← links)