Sciweavers

491 search results - page 25 / 99
» On cyclically orientable graphs
Sort
View
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
13 years 8 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 2 months ago
Counting Unique-Sink Orientations
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
Jan Foniok, Bernd Gärtner, Lorenz Klaus, Mark...
JCT
2007
140views more  JCT 2007»
13 years 8 months ago
Homomorphisms and edge-colourings of planar graphs
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
Reza Naserasr
IPL
2007
121views more  IPL 2007»
13 years 8 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
COMGEO
2012
ACM
12 years 4 months ago
Algorithms for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Sergio Cabello, Éric Colin de Verdiè...