Antimagic labeling and canonical decomposition of graphs
From MaRDI portal
Publication:991774
DOI10.1016/J.IPL.2010.01.006zbMATH Open1197.05124OpenAlexW2050399605MaRDI QIDQ991774FDOQ991774
Authors: Michael D. Barrus 
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.01.006
Recommendations
Cites Work
- Decomposition of graphical sequences and unigraphs
- The \(A_4\)-structure of a graph
- Title not available (Why is that?)
- The splittance of a graph
- Lattice grids and prisms are antimagic
- Dense graphs are antimagic
- Regular bipartite graphs are antimagic
- Title not available (Why is that?)
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Computing and Combinatorics
- On anti-magic labeling for graph products
Cited In (10)
- On antimagic labeling of regular graphs with particular factors
- On the Hartsfield-Ringel hypothesis: connected unigraphs
- Antimagic labeling graphs with a regular dominating subgraph
- Antimagic labeling of generalized pyramid graphs
- On edge-graceful labeling and deficiency for regular graphs
- Title not available (Why is that?)
- Magic and antimagic \(H\)-decompositions
- Graphs admitting antimagic labeling for arbitrary sets of positive integers
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs
This page was built for publication: Antimagic labeling and canonical decomposition of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991774)
