On the tractability of ( k , i )-coloring
From MaRDI portal
Recommendations
- On the tractability of \((k,i)\)-coloring
- Exact and parameterized algorithms for \((k,i)\)-coloring
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Fixed-parameter tractability of \((n-k)\) list coloring
- Fixed-parameter tractability of \((n-k)\) list coloring
- On the \(k\)-coloring of intervals
- scientific article; zbMATH DE number 1564005
- scientific article; zbMATH DE number 1433954
- On the complexity of \(k\)-rainbow cycle colouring problems
- On restricted colourings of \(K_ n\)
Cites work
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A note onn-tuple colourings and circular colourings of planar graphs with large odd girth
- Exact and parameterized algorithms for \((k,i)\)-coloring
- Exact exponential algorithms.
- Faster deterministic \textsc{Feedback Vertex Set}
- Generalized k-tuple colorings of cycles and other graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Inapproximability of treewidth and related problems
- Isomorphism for graphs of bounded feedback vertex set number
- NP-completeness of a family of graph-colouring problems
- On cliques in graphs
- On the \((k,i)\)-coloring of cacti and complete graphs.
- On the tractability of \((k,i)\)-coloring
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Set colourings of graphs
- \(n\)-tuple coloring of planar graphs with large odd girth
- n-tuple colorings and associated graphs
Cited in
(3)
This page was built for publication: On the tractability of \(( k , i )\)-coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235289)
