836 search results - page 15 / 168 » Orthogonal Colorings of Graphs |
108
click to vote
JGT
2007
14 years 11 months ago
2007
A graph G is a quasi-line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset ...
107
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
145
click to vote
STRINGOLOGY
2008
15 years 1 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
ISCAS
2006
IEEE
15 years 5 months ago
2006
IEEE