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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 7066127
@@ Property / title @@
+Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05242
@@ Property / zbMATH Open document ID: 1414.05242 / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/jgt.22424
@@ Property / DOI: 10.1002/jgt.22424 / rank @@
+Normal rank
@@ Property / publication date @@
+June 2019Timestamp +2019-06-14T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-06-14T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 14 June 2019 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C55
@@ Property / Mathematics Subject Classification ID: 05C55 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7066127
@@ Property / zbMATH DE Number: 7066127 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2902307809
@@ Property / OpenAlex ID: W2902307809 / rank @@
+Normal rank
@@ Property / published in @@
+Journal of Graph Theory
@@ Property / published in: Journal of Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
+Normal rank
@@ Property / cites work @@
+Vertex coverings by monochromatic cycles and trees
+Normal rank
@@ Property / cites work @@
+Q5548200
@@ Property / cites work: Q5548200 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3977492
@@ Property / cites work: Q3977492 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved bound for the monochromatic cycle partition number
+Normal rank
@@ Property / cites work @@
+Q3424878
@@ Property / cites work: Q3424878 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning 3-colored complete graphs into three monochromatic cycles
+Normal rank
@@ Property / cites work @@
+Partitioning complete bipartite graphs by monochromatic cycles
+Normal rank
@@ Property / cites work @@
+Partitioning Two-Coloured Complete Graphs into  Two Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Partitioning edge-coloured complete graphs into monochromatic cycles and paths
+Normal rank
@@ Property / Wikidata QID @@
+Q128892494
@@ 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