Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825): Difference between revisions

From MaRDI portal
Merged Item from Q5379842
Created claim: Wikidata QID (P12): Q128892494, #quickstatements; #temporary_batch_1724709170382
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic cycles and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the monochromatic cycle partition number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 3-colored complete graphs into three monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning complete bipartite graphs by monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning edge-coloured complete graphs into monochromatic cycles and paths / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128892494 / rank
 
Normal rank

Latest revision as of 22:54, 26 August 2024

scientific article; zbMATH DE number 7066127
  • Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles
Language Label Description Also known as
English
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
scientific article; zbMATH DE number 7066127
  • Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles

Statements

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (English)
0 references
Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles (English)
0 references
0 references
0 references
17 October 2016
0 references
14 June 2019
0 references
monochromatic path partition
0 references
monochromatic cycle partition
0 references
two-coloured graph
0 references

Identifiers

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