Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three (Q2124635): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4358434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with cycles having adjacent lines different colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge colorings of complete graphs without tricolored triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Edge-Colored Version of Dirac's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac Type Condition for Properly Coloured Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly edge-colored theta graphs in edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow triangles in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color degree sum conditions for rainbow triangles in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color degree and alternating cycles in edge-colored graphs / rank
 
Normal rank

Revision as of 14:40, 28 July 2024

scientific article
Language Label Description Also known as
English
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
scientific article

    Statements

    Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2022
    0 references
    edge-colored graph
    0 references
    minimum color degree
    0 references
    proper cycle
    0 references
    proper vertex-pancyclicity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references