Pages that link to "Item:Q1315460"
From MaRDI portal
The following pages link to On cocolourings and cochromatic numbers of graphs (Q1315460):
Displaying 20 items.
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- A lower bound on cochromatic number for line graphs of a kind of graphs (Q854573) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Uniquely cocolourable graphs (Q1079577) (← links)
- Advances on defective parameters in graphs (Q1751109) (← links)
- Approximating minimum cocolorings. (Q1853153) (← links)
- Critical 3-cochromatic graphs (Q1900522) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Some defective parameters in graphs (Q1950405) (← links)
- On the coequal values of total chromatic number and chromatic index (Q2101175) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Some extremal results in cochromatic and dichromatic theory (Q3984467) (← links)
- Coloring (gem, co‐gem)‐free graphs (Q4646937) (← links)
- (Q5708621) (← links)
