Graphs admitting antimagic labeling for arbitrary sets of positive integers (Q2413165): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.10.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2767153232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic labeling and canonical decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic Labeling of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice grids and prisms are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular bipartite graphs are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Graphs of Odd Degree Are Antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti‐magic graphs via the Combinatorial NullStellenSatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-magic labeling of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic Labeling of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3466244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic labeling graphs with a regular dominating subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On anti-magic labeling for graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic labelling of vertex weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic Properties of Graphs with Large Maximum Degree / rank
 
Normal rank

Latest revision as of 11:05, 15 July 2024

scientific article
Language Label Description Also known as
English
Graphs admitting antimagic labeling for arbitrary sets of positive integers
scientific article

    Statements

    Graphs admitting antimagic labeling for arbitrary sets of positive integers (English)
    0 references
    0 references
    0 references
    9 April 2018
    0 references
    0 references
    antimagic graphs
    0 references
    split graphs
    0 references
    complete bipartite graphs
    0 references
    0 references