A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Multicoloured Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored forests in bipartite decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored forests in complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow coloring the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of a theorem of Graham and Pollak / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow subgraphs in properly edge‐colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow numbers for matchings and complete graphs / 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: On the decomposition ofkn into complete bipartite graphs / rank
 
Normal rank

Revision as of 19:03, 24 June 2024

scientific article
Language Label Description Also known as
English
A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
scientific article

    Statements

    Identifiers