The following pages link to (Q2936700):
Displaying 6 items.
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
- Lower bounds on size and independence inK4-free graphs (Q4362088) (← links)
- Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
