Pages that link to "Item:Q3999001"

The following pages link to Pearls in graph theory. A comprehensive introduction (Q3999001):

Displaying 50 items.

• Puzzling and apuzzling graphs (Q322036) (← links)
• Weighted antimagic labeling: an algorithmic approach (Q324749) (← links)
• On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs (Q364571) (← links)
• On antimagic labeling of regular graphs with particular factors (Q396690) (← links)
• Anti-magic labeling of trees (Q397133) (← links)
• On conservative and supermagic graphs (Q409352) (← links)
• Weighted-1-antimagic graphs of prime power order (Q432719) (← links)
• Antimagic labeling graphs with a regular dominating subgraph (Q456149) (← links)
• Distance magic circulant graphs (Q501031) (← links)
• A frame-based approach for theoretical concepts (Q514039) (← links)
• Labelings of plane graphs containing Hamilton path (Q546299) (← links)
• An extension of regular supermagic graphs (Q607019) (← links)
• Labelings in Cayley digraphs (Q607377) (← links)
• Super \(d\)-antimagic labelings of disconnected plane graphs (Q627559) (← links)
• Construction of antimagic labeling for the Cartesian product of regular graphs (Q691635) (← links)
• Additive coloring of planar graphs (Q742621) (← links)
• Coloring chip configurations on graphs and digraphs (Q763476) (← links)
• Antimagic orientation of subdivided caterpillars (Q832995) (← links)
• Edge-antimagic graphs (Q878610) (← links)
• Regular graphs are antimagic (Q888592) (← links)
• On anti-magic labeling for graph products (Q932686) (← links)
• Antimagic labeling and canonical decomposition of graphs (Q991774) (← links)
• A new class of antimagic Cartesian product graphs (Q998385) (← links)
• The topology of continua that are approximated by disjoint subcontinua (Q1004040) (← links)
• The antimagicness of the Cartesian product of graphs (Q1006045) (← links)
• Lattice grids and prisms are antimagic (Q1022588) (← links)
• On zero-sum partitions and anti-magic trees (Q1025454) (← links)
• On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs (Q1044921) (← links)
• Super-vertex-antimagic total labelings of disconnected graphs (Q1045098) (← links)
• On the spectra of certain graphs arising from finite fields (Q1273216) (← links)
• On the relations between certain graph labelings (Q1339856) (← links)
• On edge-graceful labeling and deficiency for regular graphs (Q1643920) (← links)
• Antimagic orientation of biregular bipartite graphs (Q1676793) (← links)
• Zero sum partition of abelian groups into sets of the same order and its applications (Q1700783) (← links)
• Lexicographic product graphs \(P_m[P_n]\) are antimagic (Q1713615) (← links)
• Orientable \(\mathbb{Z}_N\)-distance magic graphs (Q1717208) (← links)
• Local antimagic orientations of \(d\)-degenerate graphs (Q1730236) (← links)
• Weighted antimagic labeling (Q1752499) (← links)
• Combinatorial properties of ring generated circular planar nearrings (Q1906141) (← links)
• Vertex-antimagic labelings of regular graphs (Q1943210) (← links)
• A class of antimagic join graphs (Q1949669) (← links)
• Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\) (Q1993366) (← links)
• Caterpillars with maximum degree 3 are antimagic (Q1999746) (← links)
• Computing edge weights of magic labeling on rooted products of graphs (Q2004217) (← links)
• Antimagic orientations of graphs with large maximum degree (Q2005714) (← links)
• Antimagic labelings of caterpillars (Q2008558) (← links)
• Antimagicness of generalized corona and snowflake graphs (Q2018665) (← links)
• Antimagicness of lexicographic product graph \(G[P_n]\) (Q2023731) (← links)
• Supermagic graphs with many different degrees (Q2042614) (← links)
• Enumeration of the edge weights of symmetrically designed graphs (Q2052124) (← links)