3204 search results - page 87 / 641 » The Alcuin Number of a Graph |
107
click to vote
CORR
2011
Springer
15 years 25 days ago
2011
Springer
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...
137
click to vote
COLING
2010
15 years 24 days ago
2010
This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference Resolution in Multiple Languages". RelaxCor is a constraint-based grap...
156
click to vote
ENDM
2007
15 years 5 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
155
click to vote
ARSCOM
2007
15 years 6 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
154
click to vote
DAM
2010
15 years 5 months ago
2010
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...