Long cycles in hypercubes with distant faulty vertices
Graphs and Algorithms
Main Authors: | Petr Gregor, Riste Škrekovski |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2009-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/466/pdf |
Similar Items
-
Gray codes avoiding matchings
by: Darko Dimitrov, et al.
Published: (2009-01-01) -
A bound on the number of perfect matchings in Klee-graphs
by: Marek Cygan, et al.
Published: (2013-01-01) -
Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01) -
Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01) -
Edge condition for long cycles in bipartite graphs
by: Lech Adamus
Published: (2009-01-01)