Pages that link to "Item:Q5311921"
From MaRDI portal
The following pages link to NP‐completeness of list coloring and precoloring extension on the edges of planar graphs (Q5311921):
Displaying 12 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities (Q2241151) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Invited talks (Q2692717) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
