Pages that link to "Item:Q2840551"
From MaRDI portal
The following pages link to Clique-Coloring Circular-Arc Graphs (Q2840551):
Displayed 11 items.
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Graphs with large clique-chromatic numbers (Q2788733) (← links)
- (Q5089217) (← links)