The following pages link to (Q5732335):
Displaying 28 items.
- The complexity of the empire colouring problem (Q476435) (← links)
- On the genus and thickness of graphs (Q581411) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- Remarks on the thickness and outerthickness of a graph (Q814092) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- On the thickness and arboricity of a graph (Q1121907) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Remarks on the thickness of a graph (Q1292575) (← links)
- A tribute to Frank Harary (in honor of his 70th birthday) (Q1388964) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- Thickness and outerthickness for embedded graphs (Q1744754) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Thickness of the subgroup intersection graph of a finite group (Q2146630) (← 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)
- Sur l'épaisseur des graphes réguliers (Q2546874) (← links)
- Graphs with forbidden subgraphs (Q2547895) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- (Q4041601) (← links)
- The thickness of K1,n,n and K2,n,n (Q4629553) (← links)
- The 6-girth-thickness of the complete graph (Q4956180) (← links)
- The thickness of the Kronecker product of graphs (Q4988856) (← links)
- The 4-girth-thickness of the complete multipartite graph (Q5009944) (← links)
- On the Bar Visibility Number of Complete Bipartite Graphs (Q5157389) (← links)
- A note on the 4-girth-thickness of K_n,n,n (Q5225019) (← links)
- Recent results in topological graph theory (Q5334842) (← links)
- The thickness of some complete bipartite and tripartite graphs (Q6639490) (← links)
