scientific article
From MaRDI portal
Publication:3999001
zbMath0703.05001MaRDI QIDQ3999001
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planar graphsRamsey numberschromatic numberscubic graphscrossing numbersHamilton cyclesspanning treesTurán's theoremEulerian circuitsgenus of a graphlabeling graphsgraphic sequences
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (only showing first 100 items - show all)
Antimagic orientation of subdivided caterpillars ⋮ On the relations between certain graph labelings ⋮ Antimagic labelling of vertex weighted graphs ⋮ Puzzling and apuzzling graphs ⋮ On edge-graceful labeling and deficiency for regular graphs ⋮ Weighted antimagic labeling: an algorithmic approach ⋮ Trees whose even-degree vertices induce a path are antimagic ⋮ Antimagic Labeling of Regular Graphs ⋮ Unnamed Item ⋮ Combinatorial properties of ring generated circular planar nearrings ⋮ Antimagic labeling of some biregular bipartite graphs ⋮ A new class of antimagic join graphs ⋮ Unnamed Item ⋮ On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs ⋮ Antimagic orientations of graphs with given independence number ⋮ A note on additive choice number of planar graphs ⋮ Local antimagic orientation of graphs ⋮ Edge-antimagic graphs ⋮ An extension of regular supermagic graphs ⋮ Super \((a,d)\)-edge antimagic total labeling of a subclass of trees ⋮ Labelings in Cayley digraphs ⋮ Antimagic orientation of biregular bipartite graphs ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive integers ⋮ On edge-graceful regular graphs with particular 3-factors ⋮ Regular Graphs of Odd Degree Are Antimagic ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ Regular graphs are antimagic ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Anti-magic labeling of trees ⋮ On conservative and supermagic graphs ⋮ Local antimagic labeling of graphs ⋮ Odd and even cycles in maker-breaker games ⋮ Super \(d\)-antimagic labelings of disconnected plane graphs ⋮ Vertex-antimagic labelings of regular graphs ⋮ Zero sum partition of abelian groups into sets of the same order and its applications ⋮ Weighted-1-antimagic graphs of prime power order ⋮ A class of antimagic join graphs ⋮ On graceful antimagic graphs ⋮ Antimagic labeling for unions of graphs with many three-paths ⋮ Antimagic labeling of generalized pyramid graphs ⋮ Lexicographic product graphs \(P_m[P_n\) are antimagic] ⋮ Antimagic labeling graphs with a regular dominating subgraph ⋮ Orientable \(\mathbb{Z}_N\)-distance magic graphs ⋮ Caterpillars are antimagic ⋮ On anti-magic labeling for graph products ⋮ Local antimagic orientations of \(d\)-degenerate graphs ⋮ On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs ⋮ On Antimagic Labeling for Generalized Web and Flower Graphs ⋮ An antimagic labeling inK2n,2n–nC4 ⋮ Distance magic circulant graphs ⋮ Bertrand's postulate, the prime number theorem and product anti-magic graphs ⋮ A frame-based approach for theoretical concepts ⋮ Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)] ⋮ Weighted antimagic labeling ⋮ Antimagic Properties of Graphs with Large Maximum Degree ⋮ Caterpillars with maximum degree 3 are antimagic ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Face antimagic labeling of Jahangir graph ⋮ Computing edge weights of magic labeling on rooted products of graphs ⋮ Antimagic orientations of graphs with large maximum degree ⋮ Antimagic labelings of caterpillars ⋮ Labelings of plane graphs containing Hamilton path ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Antimagicness of generalized corona and snowflake graphs ⋮ Antimagicness of lexicographic product graph \(G[P_n\)] ⋮ On antimagic directed graphs ⋮ An Application of the combinatorial Nullstellensatz to a graph labelling problem ⋮ Inside-out polytopes ⋮ Antimagic labeling and canonical decomposition of graphs ⋮ Regular bipartite graphs are antimagic ⋮ On magic and supermagic circulant graphs ⋮ A new class of antimagic Cartesian product graphs ⋮ Graphs of Large Linear Size Are Antimagic ⋮ The topology of continua that are approximated by disjoint subcontinua ⋮ Antimagic labelings of join graphs ⋮ The antimagicness of the Cartesian product of graphs ⋮ Supermagic graphs with many different degrees ⋮ A generalization of magic and antimagic labelings of graphs ⋮ On super edge-antimagic total labelings of \(mK_n\) ⋮ Similarity Indices for Spatia I Ecological Data ⋮ Additive coloring of planar graphs ⋮ Enumeration of the edge weights of symmetrically designed graphs ⋮ Upper bounds on inclusive distance vertex irregularity strength ⋮ Lattice grids and prisms are antimagic ⋮ On the spectra of certain graphs arising from finite fields ⋮ On zero-sum partitions and anti-magic trees ⋮ Antimagic labeling of forests with sets of consecutive integers ⋮ Coloring chip configurations on graphs and digraphs ⋮ On antimagic labellings of some cycle related graphs ⋮ A note on antimagic orientations of even regular graphs ⋮ Antimagic orientation of Halin graphs ⋮ On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs ⋮ Super-vertex-antimagic total labelings of disconnected graphs ⋮ On \((a, 1)\)-vertex-antimagic edge labeling of regular graphs ⋮ Total vertex irregularity strength of trees with maximum degree five ⋮ Antimagic labeling of new classes of trees ⋮ List-antimagic labeling of vertex-weighted graphs ⋮ Antimagic labeling of biregular bipartite graphs ⋮ ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS
This page was built for publication:
