Results 11 to 20 of about 1,361,736 (138)
Constructing sonified haptic line graphs for the blind student: first steps [PDF]
, 2000 Line graphs stand as an established information visualisation and analysis technique taught at various levels of difficulty according to standard Mathematics curricula.
Brewster, S. +5 more
core +2 more sources
Coloring triangle-free rectangle overlap graphs with $O(\log\log n)$ colors [PDF]
, 2014 Recently, it was proved that triangle-free intersection graphs of $n$ line segments in the plane can have chromatic number as large as $\Theta(\log\log n)$.
Krawczyk, Tomasz +2 more
core +4 more sources
An on-line competitive algorithm for coloring bipartite graphs without long induced paths [PDF]
, 2015 The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as induced subgraphs. We propose a
Micek, Piotr, Wiechert, Veit
core +3 more sources
Walk entropies on graphs [PDF]
, 2014 Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
de la Peña, José A. +2 more
core +1 more source
Strongly Monotone Drawings of Planar Graphs [PDF]
, 2016 A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the ...
Felsner, Stefan +5 more
core +2 more sources
A Characterization of Mixed Unit Interval Graphs [PDF]
, 2014 We give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half-open unit intervals of the real line. This is a proper superclass of the well known unit interval graphs.
CG Lekkerkerker +9 more
core +1 more source
On grounded L-graphs and their relatives [PDF]
, 2018 We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line.
Jelínek, Vít, Töpfer, Martin
core +3 more sources
On the hardness of recognizing triangular line graphs [PDF]
, 2010 Given a graph G, its triangular line graph is the graph T(G) with vertex set consisting of the edges of G and adjacencies between edges that are incident in G as well as being within a common triangle.
Anand, Pranav +4 more
core +4 more sources
Location-domination in line graphs
, 2016 A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \cap D \neq N(v) \cap D$, where $N(u)$ denotes the open neighborhood
Foucaud, Florent, Henning, Michael A.
core +3 more sources
Graphs whose line graphs are ring graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices.
openaire +2 more sources