491 search results - page 4 / 99 » On cyclically orientable graphs |
JCO
2007
14 years 9 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
VLDB
1997
ACM
15 years 1 months ago
1997
ACM
COMBINATORICS
2007
14 years 9 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
50
Voted
ENDM
2006
14 years 9 months ago
2006
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks
CATS
2006
14 years 11 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...