Pages that link to "Item:Q2346588"

The following pages link to Graphs of girth at least 7 have high \(b\)-chromatic number (Q2346588):

Displaying 13 items.

• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
• Graphs with large girth are \(b\)-continuous (Q510951) (← 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)
• Edge-\(b\)-coloring trees (Q1702122) (← links)
• Graphs with girth at least 8 are b-continuous (Q2132404) (← links)
• \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
• New bounds for the \(b\)-chromatic number of vertex deleted graphs (Q2243141) (← links)
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
• On b-acyclic chromatic number of a graph (Q2685280) (← links)
• A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)