Graphs of Large Linear Size Are Antimagic
From MaRDI portal
Publication:2800541
DOI10.1002/jgt.21872zbMath1333.05264arXiv1409.3659OpenAlexW1902759194MaRDI QIDQ2800541
Publication date: 15 April 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.3659
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (21)
Antimagic orientation of subdivided caterpillars ⋮ Local antimagic chromatic number for the corona product of wheel and null graphs ⋮ Local vertex antimagic chromatic number of some wheel related graphs ⋮ Antimagic labeling of some biregular bipartite graphs ⋮ Antimagic orientations of graphs with given independence number ⋮ Antimagic orientation of biregular bipartite graphs ⋮ Antimagic orientation of graphs with minimum degree at least 33 ⋮ Antimagic orientation of forests ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number ⋮ Caterpillars are antimagic ⋮ Local antimagic orientations of \(d\)-degenerate graphs ⋮ Partially magic labelings and the antimagic graph conjecture ⋮ A generalized version of a local antimagic labelling conjecture ⋮ Caterpillars with maximum degree 3 are antimagic ⋮ Antimagic orientations of graphs with large maximum degree ⋮ Antimagic labelings of caterpillars ⋮ A note on antimagic orientations of even regular graphs ⋮ Antimagic orientation of Halin graphs ⋮ List-antimagic labeling of vertex-weighted graphs ⋮ Antimagic labeling of biregular bipartite graphs ⋮ ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS
Cites Work
- Unnamed Item
- \(k\)-tuple total domination in graphs
- A dynamic survey of graph labeling
- Dominating a Family of Graphs with Small Connected Subgraphs
- An Application of the combinatorial Nullstellensatz to a graph labelling problem
- Dense graphs are antimagic
- Regular bipartite graphs are antimagic
- Anti‐magic graphs via the Combinatorial NullStellenSatz
This page was built for publication: Graphs of Large Linear Size Are Antimagic