Set colourings of graphs
From MaRDI portal
Cites work
- A (<5)-Colour Theorem for Planar Graphs
- Applications of product colouring
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- r-tuple colorings of uniquely colorable graphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The chromatic number and other functions of the lexicographic product
Cited in
(20)- Generalized k-tuple colorings of cycles and other graphs
- Defining sets and uniqueness in graph colorings: A survey
- Defining sets in vertex colorings of graphs and latin rectangles
- On the fractional chromatic number and the lexicographic product of graphs
- \(k\)-tuple colorings of the Cartesian product of graphs
- NP-completeness of a family of graph-colouring problems
- Chromatic invariants for finite graphs: Theme and polynomial variations
- New results in \(t\)-tone coloring of graphs
- Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
- On the tractability of ( k , i )-coloring
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs
- Set colorings of digraphs
- Exact and parameterized algorithms for (k,i)-coloring
- On multiset colorings of graphs
- \(k\)-tuple chromatic number of the Cartesian product of graphs
- On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem
- Strongly set-colorable graphs
- scientific article; zbMATH DE number 863472 (Why is no real title available?)
- Graph theory (algorithmic, algebraic, and metric problems)
- The \(t\)-tone chromatic number of random graphs
This page was built for publication: Set colourings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255964)
