Disjointness graphs of short polygonal chains

DOI10.1016/j.jctb.2023.08.008arXiv2112.05991MaRDI QIDQ6144392

Gábor Tardos, Géza Tóth, János Pach

Publication date: 29 January 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.05991

zbMATH Keywords

intersection graphcoloring number\(\chi\)-boundeddisjointness graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle-free intersection graphs of line segments with large chromatic number
• Ramsey numbers and an approximation algorithm for the vertex cover problem
• On the chromatic number of disjointness graphs of curves
• Hypergraph families with bounded edge cover or transversal number
• Ramsey partitions and proximity data structures
• Covering and coloring problems for relatives of intervals
• Coloring the hypergraph of maximal cliques of a graph with no long path
• Coloring Hasse diagrams and disjointness graphs of curves
• Ramsey theory applications
• On a Coloring Problem.
• The Complexity of Parallel Sorting
• A Ramsey-Type Result for Convex Sets
• A Visibility Representation for Graphs in Three Dimensions
• Disjointness graphs of segments
• Hasse diagrams with large chromatic number
• A survey of χ‐boundedness
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number
• An Application of Ramsey Theory to Coding for the Optical Channel
• On chromatic number of graphs and set-systems
• Coloring and Maximum Weight Independent Set of Rectangles

This page was built for publication: Disjointness graphs of short polygonal chains