The following pages link to (Q4175304):
Displayed 17 items.
- \((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)
- Induced-path partition on graphs with special blocks (Q868947) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Uniquely cocolourable graphs (Q1079577) (← links)
- Some topics in cochromatic theory (Q1121278) (← links)
- The cochromatic index of a graph (Q1144036) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Approximating minimum cocolorings. (Q1853153) (← links)
- Critical 3-cochromatic graphs (Q1900522) (← links)
- Partitioning permutations into increasing and decreasing subsequences (Q1906146) (← links)
- Chromatic number versus chromatic number in graphs with bounded clique number (Q2640609) (← links)
- A note on the bichromatic numbers of graphs (Q3061187) (← links)
- Cycles in digraphs– a survey (Q3907591) (← links)