On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles (Q4976301): Difference between revisions

@@ 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.1080/00207160.2016.1158813
+Normal rank
@@ Property / OpenAlex ID @@
+W2327426418
@@ Property / OpenAlex ID: W2327426418 / rank @@
+Normal rank
@@ Property / cites work @@
+On linear k-arboricity
@@ Property / cites work: On linear k-arboricity / rank @@
+Normal rank
@@ Property / cites work @@
+Linear \(k\)-arboricities on trees
@@ Property / cites work: Linear \(k\)-arboricities on trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
+Normal rank
@@ Property / cites work @@
+THE LINEAR 2-ARBORICITY OF PLANAR GRAPHS WITHOUT ADJACENT SHORT CYCLES
+Normal rank
@@ Property / cites work @@
+Some problems about linear arboricity
@@ Property / cites work: Some problems about linear arboricity / rank @@
+Normal rank
@@ Property / cites work @@
+On the linear \(k\)-arboricity of cubic graphs
@@ Property / cites work: On the linear \(k\)-arboricity of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without 5-cycles or without 6-cycles
+Normal rank
@@ Property / cites work @@
+Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
+Normal rank
@@ Property / cites work @@
+Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
+Normal rank