Colorability in Orthogonal Graph Drawing
From MaRDI portal
Publication:5452235
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
Cites work
- scientific article; zbMATH DE number 3520445 (Why is no real title available?)
- Bounds For Orthogonal 3-D Graph Drawing
- Colorability in Orthogonal Graph Drawing
- On Finite Polarized Partition Relations
- On representations of some thickness-two graphs
- 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)