The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\)

DOI10.1007/S40590-024-00654-ZMaRDI QIDQ6614724

J. Leaños, Author name not available (Why is that?), Mario Lomelí-Haro, Jesús J. García-Davila

Publication date: 7 October 2024

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

zbMATH Keywords

chromatic numberdisjointness graph of segmentscomplete geometric graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometric achromatic and pseudoachromatic indices
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• Kneser's conjecture, chromatic number, and homotopy
• A short proof of Kneser's conjecture
• On the chromatic number of some geometric type Kneser graphs
• Computer solution to the 17-point Erdős-Szekeres problem
• Disjointness graphs of segments
• Thickness and Antithickness of Graphs
• The Chromatic Number of the Disjointness Graph of the Double Chain
• On the connectivity of the disjointness graph of segments of point sets in general position in the plane

This page was built for publication: The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614724)