Color degree and heterochromatic cycles in edge-colored graphs (Q449221): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long heterochromatic paths in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polychromatic Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle sub-Ramsey numbers and an edge-colouring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed triangles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of a partial transversal in a Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph / rank
 
Normal rank

Revision as of 15:56, 5 July 2024

scientific article
Language Label Description Also known as
English
Color degree and heterochromatic cycles in edge-colored graphs
scientific article

    Statements

    Identifiers