Pages that link to "Item:Q2640609"
From MaRDI portal
The following pages link to Chromatic number versus chromatic number in graphs with bounded clique number (Q2640609):
Displaying 8 items.
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- The micro-world of cographs (Q831855) (← links)
- A lower bound on cochromatic number for line graphs of a kind of graphs (Q854573) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Approximating minimum cocolorings. (Q1853153) (← links)
- Partitioning permutations into increasing and decreasing subsequences (Q1906146) (← links)
- Fractional cocoloring of graphs (Q2117529) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
