62 search results - page 2 / 13 » Consistent Cycles in Graphs and Digraphs |
94
Voted
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
103
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
65
Voted
JCT
2002
14 years 11 months ago
2002
102
click to vote
GC
2008
Springer
14 years 11 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
105
click to vote
ARSCOM
2004
14 years 11 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...