Pages that link to "Item:Q3969882"
From MaRDI portal
The following pages link to Determining the thickness of graphs is NP-hard (Q3969882):
Displayed 33 items.
- Thickness and colorability of geometric graphs (Q679741) (← links)
- A note on Halton's conjecture (Q707336) (← links)
- Remarks on the thickness and outerthickness of a graph (Q814092) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs (Q1043806) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Rectangle-visibility representations of bipartite graphs (Q1363757) (← links)
- The thickness of a minor-excluded class of graphs (Q1379835) (← links)
- A tribute to Frank Harary (in honor of his 70th birthday) (Q1388964) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- Thickness and outerthickness for embedded graphs (Q1744754) (← links)
- It is tough to be a plumber (Q1885007) (← links)
- Thickness of the subgroup intersection graph of a finite group (Q2146630) (← links)
- Complexity of domination in triangulated plane graphs (Q2178742) (← links)
- The thickness of amalgamations and Cartesian product of graphs (Q2364079) (← links)
- The thickness of the complete multipartite graphs and the join of graphs (Q2410038) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method (Q3608305) (← links)
- The 6-girth-thickness of the complete graph (Q4956180) (← links)
- The 4-girth-thickness of the complete multipartite graph (Q5009944) (← links)
- Angle Covers: Algorithms and Complexity (Q5084700) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q6167856) (← links)
- The thickness of fan-planar graphs is at most three (Q6172200) (← links)