Pages that link to "Item:Q497368"

The following pages link to On bounding the difference of the maximum degree and the clique number (Q497368):

Displaying 8 items.

• Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
• Vertex colouring and forbidden subgraphs -- a survey (Q1889838) (← links)
• Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
• On bounding the difference between the maximum degree and the chromatic number by a constant (Q2403810) (← links)
• Bounding the fractional chromatic number of \(K_\Delta\)-free graphs (Q2848565) (← links)
• On hitting all maximum cliques with an independent set (Q3067059) (← links)
• \(\omega, \Delta\) and \(\chi\) (Q4242948) (← links)
• On the clique number of the square of a line graph and its relation to maximum degree of the line graph (Q5207468) (← links)