Pages that link to "Item:Q2467731"

The following pages link to \((p,1)\)-total labelling of graphs (Q2467731):

Displaying 34 items.

• \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
• \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
• On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
• On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
• Complexity of (p,1)-total labelling (Q967327) (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
• Corrigendum to ``\((p,1)\)-total labelling of graphs'' [Discrete math. 308 (2008) 496-513] (Q982632) (← links)
• \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
• Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
• On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
• Computational complexity of distance edge labeling (Q1647838) (← links)
• Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph (Q1708400) (← links)
• \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
• A structure of 1-planar graph and its applications to coloring problems (Q2000562) (← links)
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs (Q2012895) (← links)
• On \((p, 1)\)-total labelling of some 1-planar graphs (Q2227112) (← links)
• On \((p, 1)\)-total labelling of NIC-planar graphs (Q2239035) (← links)
• The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
• \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (Q2352348) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
• Facial \([r,s,t]\)-colorings of plane graphs (Q2416948) (← links)
• \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
• The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498) (← links)
• (2,1)-total labelling of planar graphs with large maximum degree (Q5069984) (← links)
• (Q5081905) (← links)
• (Q5206404) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)
• On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs (Q6117322) (← links)