Bipartite Graphs, Hamiltonicity and graphs
| Autor: | M. Sohel Rahman, Mohammad Kaykobad, Md. Tanvir Kaykobad |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Discrete mathematics
Applied Mathematics Complete bipartite graph law.invention Combinatorics Indifference graph Pathwidth law Chordal graph Line graph Discrete Mathematics and Combinatorics Cograph Pancyclic graph MathematicsofComputing_DISCRETEMATHEMATICS Mathematics Forbidden graph characterization |
| Zdroj: | Electronic Notes in Discrete Mathematics. 44:307-312 |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2013.10.048 |
| Popis: | In this paper, we present Dirac-type sufficient conditions for a bipartite graph to possess a Hamiltonian path. We also define a seemingly new family of bipartite graphs, which we call the Z graphs. We show that our sufficient condition can also ensure Hamiltonicity unless the graph is a Z graph. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect