Computation of lucky number of planar graphs is NP-hard (Q413250): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000213858 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex colouring edge partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degree constrained subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lucky labelings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge weights and vertex colours / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1,2 conjecture-the multiplicative version / rank | |||
Normal rank |
Latest revision as of 04:18, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computation of lucky number of planar graphs is NP-hard |
scientific article |
Statements
Computation of lucky number of planar graphs is NP-hard (English)
0 references
4 May 2012
0 references
lucky labeling
0 references
computational complexity
0 references
graph coloring
0 references