Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Remarks on the thickness of a graph

From MaRDI portal
Publication:1292575
Jump to:navigation, search

DOI10.1016/S0020-0255(97)10059-7zbMath0923.05033MaRDI QIDQ1292575

Tarja Systä, Isto Aho, Erkki Maekinen

Publication date: 22 June 1999

Published in: Information Sciences (Search for Journal in Brave)


zbMATH Keywords

decompositionthicknessplanarityplanar subgraphs


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items

A genetic algorithm for determining the thickness of a graph



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • On the thickness and arboricity of a graph
  • On the thickness of graphs of given degree
  • Parallel concepts in graph theory
  • The thickness of a minor-excluded class of graphs
  • The Thickness of the Complete Graph
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1292575&oldid=13399501"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki