Pages that link to "Item:Q2355753"

The following pages link to On the \(b\)-chromatic number of regular bounded graphs (Q2355753):

Displaying 12 items.

• Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs (Q339486) (← links)
• The \(b\)-chromatic number of regular graphs via the edge-connectivity (Q393940) (← links)
• On the \(b\)-chromatic number of regular graphs without 4-cycle (Q427905) (← links)
• The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335) (← links)
• On the b-coloring of tight graphs (Q512879) (← links)
• On quasi-monotonous graphs (Q897599) (← links)
• On \(b\)-colorings in regular graphs (Q1026139) (← 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\)-chromatic number of regular graphs (Q2275938) (← links)
• Graphs of girth at least 7 have high \(b\)-chromatic number (Q2346588) (← links)
• On \(b\)-greedy colourings and \(z\)-colourings (Q6633541) (← links)