Algorithmic complexity of proper labeling problems (Q391137): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C78 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
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 | |||
1-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 | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999771492 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1701.06669 / 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: Computation of lucky number of planar graphs is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the lucky choice number of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4888749 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weight choosability of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-distinguishing proper edge-colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The sigma chromatic number of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lucky labelings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5403005 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge weights and vertex colours / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Digraphs are 2-weight choosable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5403011 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hard tiling problems with simple tiles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3821582 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1,2 conjecture-the multiplicative version / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiplicative vertex-colouring weightings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gap vertex-distinguishing edge colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Even Cycle Problem for Directed Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4869540 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:44, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic complexity of proper labeling problems |
scientific article |
Statements
Algorithmic complexity of proper labeling problems (English)
0 references
10 January 2014
0 references
proper labeling
0 references
computational complexity
0 references
multiplicative vertex-coloring weightings
0 references
gap vertex-distinguishing edge colorings
0 references
fictional coloring
0 references
vertex-labeling by maximum
0 references
1-2-3-conjecture
0 references
multiplicative 1-2-3-conjecture
0 references