Coloring mixed and directional interval graphs
From MaRDI portal
Publication:6172218
DOI10.1007/978-3-031-22203-0_30arXiv2208.14250OpenAlexW4319996120MaRDI QIDQ6172218
Florian Mittelstädt, Ignaz Rutter, Alexander Wolff, Joachim Spoerhase, Johannes Zink, Grzegorz Gutowski
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14250
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Extending partial representations of proper and unit interval graphs
- A note on mixed tree coloring
- Modular decomposition and transitive orientation
- Mixed graph colorings
- Layered drawing of undirected graphs with generalized port constraints
- On two coloring problems in mixed graphs
- Upward and quasi-upward planarity testing of embedded mixed graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- Completing orientations of partially oriented graphs
- On the Upward Planarity of Mixed Plane Graphs
- Coloring mixed and directional interval graphs
This page was built for publication: Coloring mixed and directional interval graphs