Partitioning complete multipartite graphs by monochromatic trees (Q4667794): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1002/jgt.20044
@@ Property / DOI: 10.1002/jgt.20044 / rank @@
-Normal rank
@@ Property / author @@
-Mikio Kano
@@ Property / author: Mikio Kano / rank @@
-Normal rank
@@ Property / author @@
+Mikio Kano
@@ Property / author: Mikio Kano / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20044
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20044 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4231988343
@@ Property / OpenAlex ID: W4231988343 / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.20044
@@ Property / DOI: 10.1002/JGT.20044 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q2898721
@@ Property / Recommended article: Q2898721 / rank @@
+Normal rank
@@ Property / Recommended article: Q2898721 / qualifier @@
+Similarity Score: 0.90573996Amount 0.90573996
Unit 1
-Amount
+.90573996
 Unit
@@ Property / Recommended article: Q2898721 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
+Normal rank
+Similarity Score: 0.8965505Amount 0.8965505
Unit 1
-Amount
+.8965505
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Heterochromatic tree partition number in complete multipartite graphs
+Normal rank
+Similarity Score: 0.8629558Amount 0.8629558
Unit 1
-Amount
+.8629558
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Partitioning by monochromatic trees
@@ Property / Recommended article: Partitioning by monochromatic trees / rank @@
+Normal rank
@@ Property / Recommended article: Partitioning by monochromatic trees / qualifier @@
+Similarity Score: 0.8357847Amount 0.8357847
Unit 1
-Amount
+.8357847
 Unit
@@ Property / Recommended article: Partitioning by monochromatic trees / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Heterochromatic tree partition numbers for complete bipartite graphs
+Normal rank
+Similarity Score: 0.8256689Amount 0.8256689
Unit 1
-Amount
+.8256689
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Constructing trees in bipartite graphs
@@ Property / Recommended article: Constructing trees in bipartite graphs / rank @@
+Normal rank
+Similarity Score: 0.82294714Amount 0.82294714
Unit 1
-Amount
+.82294714
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3338285
@@ Property / Recommended article: Q3338285 / rank @@
+Normal rank
@@ Property / Recommended article: Q3338285 / qualifier @@
+Similarity Score: 0.82262194Amount 0.82262194
Unit 1
-Amount
+.82262194
 Unit
@@ Property / Recommended article: Q3338285 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Heterochromatic tree partition problem in complete tripartite graphs
+Normal rank
+Similarity Score: 0.8215861Amount 0.8215861
Unit 1
-Amount
+.8215861
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Partitioning complete graphs by heterochromatic trees
+Normal rank
+Similarity Score: 0.8107163Amount 0.8107163
Unit 1
-Amount
+.8107163
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Vertex partitions of \(r\)-edge-colored graphs
+Normal rank
+Similarity Score: 0.8051089Amount 0.8051089
Unit 1
-Amount
+.8051089
 Unit
+Recommender Run: Recommender Run 2