On the structure of complete graphs without alternating cycles (Q1257026): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complete graphs without polychromatic circuits / 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: Q4111595 / rank
 
Normal rank

Latest revision as of 02:05, 13 June 2024

scientific article
Language Label Description Also known as
English
On the structure of complete graphs without alternating cycles
scientific article

    Statements

    On the structure of complete graphs without alternating cycles (English)
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    Edge-Coloured Complete Graphs
    0 references
    Connected Monochromatic Spanning Subgraph
    0 references