Pages that link to "Item:Q794673"
From MaRDI portal
The following pages link to NP-completeness of some problems of partitioning and covering in graphs (Q794673):
Displaying 11 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- Two Hamiltonian cycles (Q2113347) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111) (← links)
- Balancing connected colourings of graphs (Q2699645) (← links)
- Cycle decompositions and constructive characterizations (Q5009962) (← links)
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
