4 search results - page 1 / 1 » Another Infinite Sequence of Dense Triangle-Free Graphs |
COMBINATORICS
1998
13 years 4 months ago
1998
DM
2008
13 years 4 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
SIAMDM
2008
13 years 4 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...