Pages that link to "Item:Q1791008"
From MaRDI portal
The following pages link to Maximum colorful cliques in vertex-colored graphs (Q1791008):
Displaying 8 items.
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Maximum colorful cycles in vertex-colored graphs (Q1625149) (← links)
- Maximum colorful independent sets in vertex-colored graphs (Q1792109) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Coloring the Maximal Cliques of Graphs (Q4652597) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)