Every nice graph is (1,5)-choosable (Q2171030): Difference between revisions

@@ Property / author @@
-Xuding Zhu
@@ Property / author: Xuding Zhu / rank @@
-Normal rank
@@ Property / author @@
+Xuding Zhu
@@ Property / author: Xuding Zhu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4293999390
@@ Property / OpenAlex ID: W4293999390 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05410
@@ Property / arXiv ID: 2104.05410 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-colouring edge-weightings
@@ Property / cites work: Vertex-colouring edge-weightings / rank @@
+Normal rank
@@ Property / cites work @@
+Degree constrained subgraphs
@@ Property / cites work: Degree constrained subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+A nowhere-zero point in linear mappings
@@ Property / cites work: A nowhere-zero point in linear mappings / rank @@
+Normal rank
@@ Property / cites work @@
+Weight choosability of graphs
@@ Property / cites work: Weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs: towards the 1-2-3-conjecture
+Normal rank
@@ Property / cites work @@
+Total Weight Choosability of Trees
@@ Property / cites work: Total Weight Choosability of Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs are \((1, \varDelta + 1)\)-choosable
@@ Property / cites work: Graphs are \((1, \varDelta + 1)\)-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+From the 1-2-3 conjecture to the Riemann hypothesis
+Normal rank
@@ Property / cites work @@
+Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
+Normal rank
@@ Property / cites work @@
+Edge weights and vertex colours
@@ Property / cites work: Edge weights and vertex colours / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
+Normal rank
@@ Property / cites work @@
+Weight choosability of graphs with maximum degree 4
+Normal rank
@@ Property / cites work @@
+Q3575472
@@ Property / cites work: Q3575472 / rank @@
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs
@@ Property / cites work: Total weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the weight choosability number of a graph
+Normal rank
@@ Property / cites work @@
+Total weight choosability of cone graphs
@@ Property / cites work: Total weight choosability of cone graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs with bounded maximum average degree
+Normal rank
@@ Property / cites work @@
+On vertex-coloring 13-edge-weighting
@@ Property / cites work: On vertex-coloring 13-edge-weighting / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-coloring 3-edge-weighting of some graphs
@@ Property / cites work: Vertex-coloring 3-edge-weighting of some graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-connected chordal graphs and line graphs are \((1,5)\)-choosable
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs
@@ Property / cites work: Total weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Permanent index of matrices associated with graphs
+Normal rank
@@ Property / cites work @@
+Every graph is \((2,3)\)-choosable
@@ Property / cites work: Every graph is \((2,3)\)-choosable / rank @@
+Normal rank