Edge condition for long cycles in bipartite graphs
Graphs and Algorithms
Main Author: | Lech Adamus |
---|---|
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/452/pdf |
Similar Items
-
Ore and Erdős type conditions for long cycles in balanced bipartite graphs
by: Janusz Adamus, et al.
Published: (2009-01-01) -
Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-01) -
Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01) -
Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01) -
On the Meyniel condition for hamiltonicity in bipartite digraphs
by: Janusz Adamus, et al.
Published: (2014-05-01)