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

Orienting planar graphs

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

DOI10.1016/0012-365X(76)90065-0zbMath0318.05102OpenAlexW1987887595MaRDI QIDQ1222167

G. R. Kampen

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0012-365x(76)90065-0



Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)


Related Items (8)

An efficient parallel algorithm for finding rectangular duals of plane triangular graphs ⋮ On the tree number of regular graphs ⋮ Planar graphs and poset dimension ⋮ Minimum degree and minimum number of edge-disjoint trees ⋮ Matching edges and faces in polygonal partitions ⋮ Does contraction preserve triangular meshes? ⋮ Tree decomposition ⋮ Tree decompositions for a class of graphs



Cites Work

  • Parallel concepts in graph theory
  • Convex Maps
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Orienting planar graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1222167&oldid=13294451"
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 08:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki