The Maximal Clique and Colourability of Curve Contact Graphs
نویسنده
چکیده
Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of simple curves, and line segments as a special case, in the plane are considered. The curve contact representations are studied with respect to the maximal clique and the chromatic number of the represented graphs. All possible curve contact representations of cliques are described, and a linear bound on chromatic number in the maximal clique size is proved for the curve contact graphs.
منابع مشابه
3-Colourability of Dually Chordal Graphs in Linear Time
A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T . This paper investigates the Colourability problem on dually chordal graphs. It will show that it is NP-complete in case of four colours and solvable in linear time with a simple algorithm in case of three colours. In addition, it will be shown that a dually chordal graph is ...
متن کاملColouring graphs with constraints on connectivity
A graph G has maximal local edge-connectivity k if the maximum number of edge-disjoint paths between every pair of distinct vertices x and y is at most k. We prove Brooks-type theorems for k-connected graphs with maximal local edge-connectivity k, and for any graph with maximal local edge-connectivity 3. We also consider several related graph classes defined by constraints on connectivity. In p...
متن کامل5-colouring graphs with 4 crossings
We disprove a conjecture of Oporowski and Zhao stating that every graph with crossing number at most 5 and clique number at most 5 is 5-colourable. However, we show that every graph with crossing number at most 4 and clique number at most 5 is 5-colourable. We also show some colourability results on graphs that can be made planar by removing few edges. In particular, we show that if a graph wit...
متن کامل(Delta-k)-critical graphs
Every graphG of maximum degree is ( +1)-colourable and a classical theorem of Brooks states that G is not -colourable iff G has a ( + 1)-clique or = 2 and G has an odd cycle. Reed extended Brooks’ Theorem by showing that if (G) 1014 then G is not ( − 1)-colourable iff G contains a -clique. We extend Reed’s characterization of ( − 1)-colourable graphs and characterize ( − 2), ( −3), ( −4) and ( ...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 81 شماره
صفحات -
تاریخ انتشار 1998