On grounded \(\llcorner\)-graphs and their relatives

zbMath1441.05164MaRDI QIDQ2315438

Martin Töpfer, Vít Jelínek

Publication date: 5 August 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i3p17

zbMATH Keywords

vertex orderingintersection classes

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Finding a Maximum Clique in a Grounded 1-Bend String Graph ⋮ Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Coloring triangle-free L-graphs with \(O (\log \log n)\) colors ⋮ Recognizing geometric intersection graphs stabbed by a line ⋮ Computing maximum independent set on outerstring graphs and their relatives ⋮ Outerstring Graphs are $\chi$-Bounded

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Max point-tolerance graphs
• The max clique problem in classes of string-graphs
• On bounding the chromatic number of L-graphs
• Ordering without Forbidden Patterns
• Graph Classes: A Survey
• Intersection Graphs of Rays and Grounded Segments
• Outerstring graphs are χ-bounded
• On the computational complexity of ordered subgraph recognition
• Every planar graph is the intersection graph of segments in the plane
• (c-)AND: A new graph model
• Refining the hierarchies of classes of geometric intersection graphs

This page was built for publication: On grounded \(\llcorner\)-graphs and their relatives