scientific article; zbMATH DE number 3611388
From MaRDI portal
Publication:4175304
Cited in
(30)- Partitioning graphs into complete and empty graphs
- Uniquely cocolourable graphs
- Some topics in cochromatic theory
- The cochromatic index of a graph
- A sequential coloring algorithm for finite sets
- On cocolourings and cochromatic numbers of graphs
- Subcolorings and the subchromatic number of a graph
- Advances on defective parameters in graphs
- The subchromatic number of a graph
- Approximating minimum cocolorings.
- Critical 3-cochromatic graphs
- Partitioning permutations into increasing and decreasing subsequences
- Some defective parameters in graphs
- Generalised online colouring problems in overlap graphs
- Fractional cocoloring of graphs
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- Fixed-parameter algorithms for the cocoloring problem
- Chromatic number versus chromatic number in graphs with bounded clique number
- A note on the bichromatic numbers of graphs
- A Brooks-type theorem for the bichromatic number
- Cycles in digraphs– a survey
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
- Some of my favorite coloring problems for graphs and digraphs
- Bounds on the lettericity of graphs
- On the complexity of generalized chromatic polynomials
- On the difference between the chromatic and cochromatic number
- \((p,k)\)-coloring problems in line graphs
- Partitioning permutations into monotone subsequences
- A lower bound on cochromatic number for line graphs of a kind of graphs
- Induced-path partition on graphs with special blocks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175304)
