Orienting planar graphs

DOI10.1016/0012-365X(76)90065-0MaRDI QIDQ1222167zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Convex Maps
• Parallel concepts in graph theory

Cited in

(8)

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

This page was built for publication: Orienting planar graphs

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