64 search results - page 7 / 13 » Exact Elimination of Cycles in Graphs |
COMBINATORICS
2007
13 years 7 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
VVS
1998
IEEE
13 years 11 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
AAAI
2004
13 years 8 months ago
2004
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
IPL
2008
13 years 7 months ago
2008
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...