131 search results - page 19 / 27 » 2-Factors in Hamiltonian Graphs |
WG
2004
Springer
15 years 5 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
TC
1998
14 years 11 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
DM
2008
14 years 12 months ago
2008
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
102
click to vote
MCU
2004
15 years 1 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
DAC
1995
ACM
15 years 3 months ago
1995
ACM
––This paper describes algorithms for automatic layout synthesisofleafcellsin1–dandinanew1–1/2–dlayoutstyle,useful for non–dual circuit styles. The graph theory based a...