Colorability in Orthogonal Graph Drawing

DOI10.1007/978-3-540-77537-9_32zbMATH Open1137.68461OpenAlexW1509916899MaRDI QIDQ5452235FDOQ5452235

Jan Štola

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_32

Recommendations

• Coloring an Orthogonality Graph
• Orthogonal colorings of graphs
• scientific article; zbMATH DE number 4008416
• Oriented graph coloring
• scientific article; zbMATH DE number 3935075
• Colorings and orientations of graphs
• Graph colorings
• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with flexibility constraints
• Orthogonal vector coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• On Finite Polarized Partition Relations
• On representations of some thickness-two graphs
• Colorability in Orthogonal Graph Drawing
• Bounds For Orthogonal 3-D Graph Drawing
• Rectangle-visibility Layouts of Unions and Products of Trees

Cited In (7)

• Colorability in Orthogonal Graph Drawing
• Orthogonal colorings of graphs
• Unimaximal Sequences of Pairs in Rectangle Visibility Drawing
• Coloring an Orthogonality Graph
• Grid drawings of \(k\)-colourable graphs
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• Coloring drawings of bipartite graphs: A problem in automated assembly

This page was built for publication: Colorability in Orthogonal Graph Drawing

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