A construction of thickness-minimal graphs

DOI10.1016/0012-365X(87)90195-6zbMATH Open0614.05022OpenAlexW2000917187MaRDI QIDQ1820166FDOQ1820166

Authors: Jozef Širáň, Peter Horák 

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90195-6

Recommendations

• Thickness and connectivity in graphs
• A class of thickness-minimal graphs
• The thickness of the Cartesian product of two graphs
• The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
• The thickness of a minor-excluded class of graphs

zbMATH Keywords

minimum degreethicknessedge-connectivityt-minimal graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Parallel concepts in graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of thickness-minimal graphs
• Thickness and connectivity in graphs
• Note on T-Minimal Complete Bipartite Graphs
• Title not available (Why is that?)

Cited In (4)

• Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
• Maximizing the degree of (geometric) thickness-\(t\) regular graphs
• A class of thickness-minimal graphs
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: A construction of thickness-minimal graphs

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