Add to ORKGAbstract We show that the lines of every arrangement of n lines in the plane can be colored with O( n/ log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a Θ( √ log n) factor. Any further improvement on this bound would also improve the best known lower bound on the following problem of Erdős: estimate the maximum number of points in general position within a set of n points containing no four collinear points
We prove that every graph with circumference at most k is O(log k)- colourable such that every monoc...
The old problem of determining the chromatic number of the plane is revisited. The question of the c...
AbstractSuppose we wish to color the edges of the complete graph Kn with as many colors as possible ...
Abstract We show that the lines of every arrangement of n lines in the plane can be colored with O( ...
Given a simple arrangement of lines in the plane, what is the minimum number c of colors required to...
Given a simple arrangement of lines in the plane, what is the minimum number c of colors required so...
金沢大学This paper presents an efficient algorithm for construction at-most-k levels of an arrangement o...
Abstract We estimate the minimum length of a longest monotone path in an arrangement of n lines, whe...
To a set of n points in the plane, one can associate a graph that has less than n 2 vertices and has...
For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions...
AbstractLet f(G) be the maximum number of colors in a vertex coloring of a simple plane graph G such...
Given a 2-coloring of the vertices of a regular n-gon P , how many parallel lines are needed to sepa...
AbstractUsing counting arguments we extend previous results concerning the coloring of lines in a fi...
AbstractTo a set of n points in the plane, one can associate a graph that has less than n2 vertices ...
summary:What is the least number of colours which can be used to colour all points of the real Eucli...
We prove that every graph with circumference at most k is O(log k)- colourable such that every monoc...
The old problem of determining the chromatic number of the plane is revisited. The question of the c...
AbstractSuppose we wish to color the edges of the complete graph Kn with as many colors as possible ...
Abstract We show that the lines of every arrangement of n lines in the plane can be colored with O( ...
Given a simple arrangement of lines in the plane, what is the minimum number c of colors required to...
Given a simple arrangement of lines in the plane, what is the minimum number c of colors required so...
金沢大学This paper presents an efficient algorithm for construction at-most-k levels of an arrangement o...
Abstract We estimate the minimum length of a longest monotone path in an arrangement of n lines, whe...
To a set of n points in the plane, one can associate a graph that has less than n 2 vertices and has...
For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions...
AbstractLet f(G) be the maximum number of colors in a vertex coloring of a simple plane graph G such...
Given a 2-coloring of the vertices of a regular n-gon P , how many parallel lines are needed to sepa...
AbstractUsing counting arguments we extend previous results concerning the coloring of lines in a fi...
AbstractTo a set of n points in the plane, one can associate a graph that has less than n2 vertices ...
summary:What is the least number of colours which can be used to colour all points of the real Eucli...
We prove that every graph with circumference at most k is O(log k)- colourable such that every monoc...
The old problem of determining the chromatic number of the plane is revisited. The question of the c...
AbstractSuppose we wish to color the edges of the complete graph Kn with as many colors as possible ...