144 search results - page 10 / 29 » On the maximum number of edges in quasi-planar graphs |
CORR
2004
Springer
14 years 11 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
DM
2008
14 years 12 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
100
click to vote
JDA
2010
14 years 6 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
102
click to vote
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
96
Voted
DAM
2008
14 years 12 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...