scientific article; zbMATH DE number 3195968
From MaRDI portal
Publication:5732335
Cited in
(31)- Non-planar core reduction of graphs
- On the thickness and arboricity of a graph
- On the thickness of graphs of given degree
- Remarks on the thickness of a graph
- A tribute to Frank Harary (in honor of his 70th birthday)
- A genetic algorithm for determining the thickness of a graph
- Thickness and outerthickness for embedded graphs
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Thickness of the subgroup intersection graph of a finite group
- The thickness of amalgamations and Cartesian product of graphs
- The thickness of the complete multipartite graphs and the join of graphs
- Sur l'épaisseur des graphes réguliers
- Graphs with forbidden subgraphs
- A simulated annealing algorithm for determining the thickness of a graph
- scientific article; zbMATH DE number 3455289 (Why is no real title available?)
- The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
- The complexity of the empire colouring problem
- The 6-girth-thickness of the complete graph
- The thickness of the Kronecker product of graphs
- The 4-girth-thickness of the complete multipartite graph
- On the bar visibility number of complete bipartite graphs
- A note on the 4-girth-thickness of \({K_{n,n,n}}^*\)
- Recent results in topological graph theory
- On the genus and thickness of graphs
- The thickness of fan-planar graphs is at most three
- The thickness of some complete bipartite and tripartite graphs
- Thickness and colorability of geometric graphs
- The thickness of a graph with constraint on girth
- Structural parameterizations of simultaneous planarity
- Remarks on the thickness and outerthickness of a graph
- On \(k\)-planar crossing numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5732335)