Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth

No abstract is available for this paper.

• Publication year

  1998

• Venue

  European journal of combinatorics (Print)

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1006/eujc.1997.0151
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Colouring Arcwise Connected Sets in the Plane I

  2000cited by this paper
• A coloring problem

  1991cited by this paper
• Covering and coloring problems for relatives of intervals

  1985cited by this paper

• On the Cop Number of String Graphs

  2024cites this paper
• Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity

  2024cites this paper
• An 11/6-Approximation Algorithm for Vertex Cover on String Graphs

  2024cites this paper
• Pseudoline arrangement graphs: degree sequences and eccentricities

  2021cites this paper
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number

  2020cites this paper
• Grid Intersection Graphs and Order Dimension

  2018cites this paper
• Conflict-Free Coloring of String Graphs

  2017cites this paper
• Thickness and Antithickness of Graphs

  2017cites this paper
• Intersection Graphs of Rays and Grounded Segments

  2016cites this paper
• Intersection graphs and geometric objects in the plane

  2016cites this paper
• Grid Intersection Graphs and Order Dimension

  2015cites this paper
• Max Point-Tolerance Graphs 1

  2015cites this paper
• Max point-tolerance graphs

  2015cites this paper
• Solving Optimization Problems on Orthogonal Ray Graphs

  2015cites this paper
• Cops and Robbers on Intersection Graphs

  2013cites this paper
• Some properties of k-Delaunay and k-Gabriel graphs

  2013cites this paper
• On orthogonal ray trees

  2013cites this paper
• Triangle-free intersection graphs of line segments with large chromatic number

  2012cites this paper
• Coloring intersection graphs of x-monotone curves in the plane

  2012cites this paper
• Some properties of higher order delaunay and gabriel graphs

  2010cites this paper
• On two-directional orthogonal ray graphs

  2010cites this paper
• On orthogonal ray graphs

  2010cites this paper
• The discharging method in combinatorial geometry and the Pach – Sharir conjecture

  2009cites this paper
• A Separator Theorem for String Graphs and its Applications

  2009cites this paper
• Coloring kk-free intersection graphs of geometric objects in the plane

  2008cites this paper
• Research problems in discrete geometry

  2005cites this paper
• Coloring intersection graphs of geometric figures with a given clique number

  2004cites this paper
• Bounds on the chromatic number of intersection graphs of sets in the plane

  2003cites this paper
• Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions

  2002cites this paper
• Colouring triangle-free intersection graphs of boxes on the plane

  2000cites this paper
• Colouring Arcwise Connected Sets in the Plane I

  2000cites this paper