Pages that link to "Item:Q512872"
From MaRDI portal
The following pages link to A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872):
Displayed 6 items.
- On the complexity of local-equitable coloring of graphs (Q2077396) (← links)
- A generalization of Grötzsch Theorem on the local-equitable coloring (Q2110276) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS (Q5148052) (← links)