The following pages link to Set colourings of graphs (Q1255964):
Displaying 20 items.
- \(k\)-tuple chromatic number of the Cartesian product of graphs (Q324798) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- The \(t\)-tone chromatic number of random graphs (Q742618) (← links)
- Generalized k-tuple colorings of cycles and other graphs (Q1154475) (← links)
- Defining sets and uniqueness in graph colorings: A survey (Q1299076) (← links)
- Defining sets in vertex colorings of graphs and latin rectangles (Q1356483) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
- NP-completeness of a family of graph-colouring problems (Q1835680) (← links)
- Chromatic invariants for finite graphs: Theme and polynomial variations (Q1899442) (← links)
- New results in \(t\)-tone coloring of graphs (Q1953497) (← links)
- Planar graphs without 4- and 6-cycles are (7 : 2)-colorable (Q2185814) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
- Set colorings of digraphs (Q2831597) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- On multiset colorings of graphs (Q3059086) (← links)
- On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem (Q3895483) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
- (Q4871751) (← links)
