On orthogonal ray trees
From MaRDI portal
Publication:908312
DOI10.1016/j.dam.2015.07.034zbMath1329.05274OpenAlexW1153726246MaRDI QIDQ908312
Asahi Takaoka, Shuichi Ueno, Kousuke Nishikawa, Irina Mustaţă, Satoshi Tayu
Publication date: 4 February 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.034
Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The clique problem in ray intersection graphs
- Bandwidth of convex bipartite graphs and related graphs
- On orthogonal ray graphs
- Two remarks on circular arc graphs
- Grid intersection graphs and boxicity
- Circular-arc graphs with clique cover number two
- On grid intersection graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- A special planar satisfiability problem and a consequence of its NP- completeness
- Intersection graphs of segments
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth
- Efficient graph representations
- Induced matchings in asteroidal triple-free graphs
- On computing a longest path in a tree
- Algorithmic graph theory and perfect graphs
- List homomorphisms and circular arc graphs
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
- Jump Number of Two-Directional Orthogonal Ray Graphs
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Every planar graph is the intersection graph of segments in the plane
- Maximum matching in a convex bipartite graph
