263 search results - page 50 / 53 » ejc 2007 |
107
Voted
EJC
2008
14 years 11 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
EJC
2008
14 years 11 months ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
98
Voted
EJC
2008
14 years 11 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
114
click to vote
EJC
2008
14 years 11 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
103
click to vote
EJC
2007
14 years 11 months ago
2007
Let A and B be hypergraphs with a common vertex set V . In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V . The game ends whe...