Algorithmic complexity of proper labeling problems (Q391137): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C78
@@ Property / Mathematics Subject Classification ID: 05C78 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6244033
@@ Property / zbMATH DE Number: 6244033 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+proper labeling
@@ Property / zbMATH Keywords: proper labeling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multiplicative vertex-coloring weightings
@@ Property / zbMATH Keywords: multiplicative vertex-coloring weightings / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+gap vertex-distinguishing edge colorings
@@ Property / zbMATH Keywords: gap vertex-distinguishing edge colorings / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fictional coloring
@@ Property / zbMATH Keywords: fictional coloring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+vertex-labeling by maximum
@@ Property / zbMATH Keywords: vertex-labeling by maximum / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-2-3-conjecture
@@ Property / zbMATH Keywords: 1-2-3-conjecture / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multiplicative 1-2-3-conjecture
@@ Property / zbMATH Keywords: multiplicative 1-2-3-conjecture / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1999771492
@@ Property / OpenAlex ID: W1999771492 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06669
@@ Property / arXiv ID: 1701.06669 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colouring edge partitions
@@ Property / cites work: Vertex colouring edge partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Degree constrained subgraphs
@@ Property / cites work: Degree constrained subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computation of lucky number of planar graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+On the lucky choice number of graphs
@@ Property / cites work: On the lucky choice number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / 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 @@
+Weight choosability of graphs
@@ Property / cites work: Weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+The sigma chromatic number of a graph
@@ Property / cites work: The sigma chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Lucky labelings of graphs
@@ Property / cites work: Lucky labelings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
+Normal rank
@@ Property / cites work @@
+Q5403005
@@ Property / cites work: Q5403005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+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 @@
+Digraphs are 2-weight choosable
@@ Property / cites work: Digraphs are 2-weight choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Q5403011
@@ Property / cites work: Q5403011 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard tiling problems with simple tiles
@@ Property / cites work: Hard tiling problems with simple tiles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3821582
@@ Property / cites work: Q3821582 / rank @@
+Normal rank
@@ Property / cites work @@
+,2 conjecture-the multiplicative version
@@ Property / cites work: 1,2 conjecture-the multiplicative version / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplicative vertex-colouring weightings of graphs
+Normal rank
@@ Property / cites work @@
+Gap vertex-distinguishing edge colorings of graphs
+Normal rank
@@ Property / cites work @@
+The Even Cycle Problem for Directed Graphs
@@ Property / cites work: The Even Cycle Problem for Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:391137