A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three
decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit …

Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show
that any planar graph has an even subdivision whose complement is a ray intersection …

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three
decades ago, an elegant polynomial-time algorithm was found for\textsc {Maximum Clique} …

We propose a polynomial-time algorithm which takes as input a finite set of points of R^ 3
and computes, up to arbitrary precision, a maximum subset with diameter at most 1. More …

In 1985, Erdős and Nešetřil conjectured that the square of the line graph of a graph, that is,,
can be colored with colors. This conjecture implies the weaker conjecture that the clique …

We prove that the clique number of the square of a line graph of a graph G is at most 1.5 Δ G
2 and that the fractional strong chromatic index of G is at most 1.75 Δ G 2. An edge coloring …

Minimal asymmetric graphs - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search ScienceDirect …

A strong edge-coloring of a graph G is a coloring of the edges of G such that each color
class is an induced matching. The strong chromatic index of G is the minimum number of …

We present a fixed parameter tractable algorithm for the Independent Set problem in 2-dir
graphs and also its generalization to d-dir graphs. A graph belongs to the class of d-dir …

For a graph G, L (G)^ 2 L (G) 2 is the square of the line graph of G–that is, vertices of L (G)^ 2
L (G) 2 are edges of G and two edges e, f ∈ E (G) e, f∈ E (G) are adjacent in L (G)^ 2 L (G) 2 …