Pages that link to "Item:Q5494862"
From MaRDI portal
The following pages link to The Star and Biclique Coloring and Choosability Problems (Q5494862):
Displaying 10 items.
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Complexity of restricted variant of star colouring (Q779165) (← links)
- On the equitable choosability of the disjoint union of stars (Q2084783) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Intersection graph of maximal stars (Q2197473) (← links)
- On star and biclique edge-colorings (Q2968507) (← links)
- (Q4926095) (← links)
- (Q5442528) (← links)