A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235): Difference between revisions

@@ Property / DOI @@
-.1007/s10898-015-0360-x
@@ Property / DOI: 10.1007/s10898-015-0360-x / rank @@
-Normal rank
@@ Property / author @@
-Wei Fan Wang
@@ Property / author: Wei Fan Wang / rank @@
-Normal rank
@@ Property / author @@
-Yi Qiao Wang
@@ Property / author: Yi Qiao Wang / rank @@
-Normal rank
@@ Property / author @@
+Wei Fan Wang
@@ Property / author: Wei Fan Wang / rank @@
+Normal rank
@@ Property / author @@
+Yi Qiao Wang
@@ Property / author: Yi Qiao Wang / 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.1007/s10898-015-0360-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1851117818
@@ Property / OpenAlex ID: W1851117818 / rank @@
+Normal rank
@@ Property / cites work @@
+\(r\)-strong edge colorings of graphs
@@ Property / cites work: \(r\)-strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent Vertex Distinguishing Edge‐Colorings
@@ Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex-distinguishing proper edge-colorings of graphs
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+\(L(h,1)\)-labeling subclasses of planar graphs
@@ Property / cites work: \(L(h,1)\)-labeling subclasses of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545841
@@ Property / cites work: Q5545841 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+On Neighbor-Distinguishing Index of Planar Graphs
@@ Property / cites work: On Neighbor-Distinguishing Index of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(d\)-strong edge colorings of graphs
@@ Property / cites work: \(d\)-strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
+Normal rank
@@ Property / cites work @@
+The surviving rate of an outerplanar graph for the firefighter problem
+Normal rank
@@ Property / cites work @@
+Some bounds on the neighbor-distinguishing index of graphs
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294976
@@ Property / cites work: Q5294976 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10898-015-0360-X
@@ Property / DOI: 10.1007/S10898-015-0360-X / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:288235