New sufficient conditions for bipancyclicity of balanced bipartite digraphs
| Autor: | Mariusz Meszka |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
Mathematics::Combinatorics 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology 01 natural sciences Theoretical Computer Science Combinatorics Computer Science::Discrete Mathematics 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Bipartite graph Discrete Mathematics and Combinatorics Computer Science::Data Structures and Algorithms Mathematics |
| Zdroj: | Discrete Mathematics. 341:3237-3240 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2018.08.004 |
| Popis: | The main results provide sufficient conditions for balanced bipartite digraphs to be bipancyclic. These are analogues to well-known results on pancyclic digraphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect