Coloring Hasse diagrams and disjointness graphs of curves

DOI10.1007/978-3-030-35802-0_19OpenAlexW2990365891WikidataQ128993295 ScholiaQ128993295MaRDI QIDQ2206854

István Tomon, János Pach

Publication date: 26 October 2020

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

zbMATH Keywords

chromatic numberHasse diagramstring graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Disjointness graphs of short polygonal chains ⋮ Hasse diagrams with large chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle-free intersection graphs of line segments with large chromatic number
• Weakly transitive orientations, Hasse diagrams and string graphs
• On the chromatic number of multiple interval graphs and overlap graphs
• String graphs. I: The number of critical nonstring graphs is infinite
• Comparability graphs and intersection graphs
• Chromatic number of Hasse diagrams, eyebrows and dimension
• Intersection graphs of curves in the plane
• Colouring lattices
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Some geometric applications of Dilworth's theorem
• Covering and coloring polygon-circle graphs
• Note on geometric graphs
• Graph Theory and Probability
• On a Coloring Problem.
• Disjointness graphs of segments
• Topology of Thin Film RC Circuits
• String graphs and incomparability graphs

This page was built for publication: Coloring Hasse diagrams and disjointness graphs of curves