Remarks on the thickness and outerthickness of a graph

DOI10.1016/J.CAMWA.2004.10.048zbMATH Open1080.05076OpenAlexW2041376359MaRDI QIDQ814092FDOQ814092

Authors: Timo Poranen, Erkki Mäkinen 

Publication date: 2 February 2006

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.10.048

Recommendations

• scientific article
• A note on the thickness of some complete bipartite graphs
• The thickness of the complete multipartite graphs and the join of graphs
• On the relationship between the thickness of some complete bipartite graphs and complete tripartite graphs
• The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)

zbMATH Keywords

combinatorial problemsannealing algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Parallel concepts in graph theory
• A note on Halton's conjecture
• Biplanar graphs: A survey
• Title not available (Why is that?)
• On the thickness and arboricity of a graph
• On the thickness of graphs of given degree
• Title not available (Why is that?)
• Determining the thickness of graphs is NP-hard
• Title not available (Why is that?)
• A simulated annealing algorithm for determining the thickness of a graph
• Title not available (Why is that?)

Cited In (13)

• A note on fold thickness of graphs
• Title not available (Why is that?)
• Thickness and Antithickness of Graphs
• Thickness and outerthickness for embedded graphs
• Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
• A simulated annealing algorithm for determining the thickness of a graph
• Title not available (Why is that?)
• Remarks on the thickness of K_n,n,n
• Title not available (Why is that?)
• The complexity of the empire colouring problem
• The thickness of some complete bipartite and tripartite graphs
• Title not available (Why is that?)
• Thickness and connectivity in graphs

This page was built for publication: Remarks on the thickness and outerthickness of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814092)