Computation of lucky number of planar graphs is NP-hard (Q413250): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2011.11.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2000213858
@@ Property / OpenAlex ID: W2000213858 / 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 @@
+Lucky labelings of graphs
@@ Property / cites work: Lucky labelings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Edge weights and vertex colours
@@ Property / cites work: Edge weights and vertex colours / rank @@
+Normal rank
@@ Property / cites work @@
+,2 conjecture-the multiplicative version
@@ Property / cites work: 1,2 conjecture-the multiplicative version / rank @@
+Normal rank