Optimal channel assignment with list-edge coloring (Q2424801): Difference between revisions

@@ Property / author @@
-Hui-Juan Wang
@@ Property / author: Hui-Juan Wang / rank @@
-Normal rank
@@ Property / author @@
+Hui-Juan Wang
@@ Property / author: Hui-Juan 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/s10878-018-00376-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2908554466
@@ Property / OpenAlex ID: W2908554466 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating the edge-colourings and total colourings of a regular graph
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+Normal rank
@@ Property / cites work @@
+Coloring of double disk graphs
@@ Property / cites work: Coloring of double disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of planar graph choosability
@@ Property / cites work: The complexity of planar graph choosability / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on \((a:b)\)-choosability
@@ Property / cites work: Some results on \((a:b)\)-choosability / rank @@
+Normal rank
@@ Property / cites work @@
+Some upper bounds on the total and list chromatic numbers of multigraphs
+Normal rank
@@ Property / cites work @@
+List edge and list total colorings of planar graphs without 4-cycles
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Lower Bounds for List Edge Coloring
@@ Property / cites work: Tight Lower Bounds for List Edge Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
+Normal rank
@@ Property / cites work @@
+Total colorings and list total colorings of planar graphs without intersecting 4-cycles
+Normal rank
@@ Property / cites work @@
+\(T\)-colorings of graphs: recent results and open problems
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
+Normal rank
@@ Property / cites work @@
+Minimum total coloring of planar graph
@@ Property / cites work: Minimum total coloring of planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the minimum number of choosability of planar graphs
+Normal rank
@@ Property / cites work @@
+Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2424801