Antimagic labeling and canonical decomposition of graphs
From MaRDI portal
(Redirected from Publication:991774)
Recommendations
Cites work
- scientific article; zbMATH DE number 3674138 (Why is no real title available?)
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Computing and Combinatorics
- Decomposition of graphical sequences and unigraphs
- Dense graphs are antimagic
- Lattice grids and prisms are antimagic
- On anti-magic labeling for graph products
- Regular bipartite graphs are antimagic
- The \(A_4\)-structure of a graph
- The splittance of a graph
Cited in
(10)- On antimagic labeling of regular graphs with particular factors
- Antimagic labeling graphs with a regular dominating subgraph
- On the Hartsfield-Ringel hypothesis: connected unigraphs
- Antimagic labeling of generalized pyramid graphs
- On edge-graceful labeling and deficiency for regular graphs
- scientific article; zbMATH DE number 5026374 (Why is no real title available?)
- 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)