Sufficient conditions for a balanced bipartite digraph to be even pancyclic (Q1701114): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.12.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2782285325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and paths of many lengths in bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for a digraph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in bipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Meyniel's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for the hamiltonian property of digraphs with large semi-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pancyclicity of digraphs with large semi-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pancyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on pancyclic-oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition implying a digraph to be pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long Cycles in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344011 / rank
 
Normal rank

Latest revision as of 05:44, 15 July 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for a balanced bipartite digraph to be even pancyclic
scientific article

    Statements

    Sufficient conditions for a balanced bipartite digraph to be even pancyclic (English)
    0 references
    22 February 2018
    0 references
    digraphs
    0 references
    cycles
    0 references
    Hamiltonian cycles
    0 references
    bipartite balanced digraph
    0 references
    pancyclic
    0 references
    even pancyclic
    0 references
    longest non-Hamiltonian cycles
    0 references

    Identifiers