On the number of alternating paths in bipartite complete graphs (Q2014212): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2297478040 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.04923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloured Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Hamiltonian cycles having adjacent lines different colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of results on rainbow Hamilton cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Hamilton cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4212172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting paths in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of the colored complete graph / rank
 
Normal rank

Latest revision as of 06:36, 14 July 2024

scientific article
Language Label Description Also known as
English
On the number of alternating paths in bipartite complete graphs
scientific article

    Statements

    On the number of alternating paths in bipartite complete graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    alternating paths
    0 references
    Hamming distance
    0 references
    random colorings
    0 references
    integer programs
    0 references
    alternating connectivity
    0 references
    0 references
    0 references