Pages that link to "Item:Q4406072"
From MaRDI portal
The following pages link to NP completeness of the edge precoloring extension problem on bipartite graphs (Q4406072):
Displaying 19 items.
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
- On avoiding some families of arrays (Q764884) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- The hardness of train rearrangements (Q1015300) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Avoiding and extending partial edge colorings of hypercubes (Q2122768) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Restricted extension of sparse partial edge colorings of hypercubes (Q2198375) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Restricted cycle factors and arc-decompositions of digraphs (Q2354716) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Restricted extension of sparse partial edge colorings of complete graphs (Q2662349) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Complexity of Locally Injective Homomorphism to the Theta Graphs (Q3000520) (← links)
- Locally Injective Homomorphism to the Simple Weight Graphs (Q3010426) (← links)
- Extending upward planar graph drawings (Q5896867) (← links)
- Flexibility of triangle‐free planar graphs (Q6055413) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
