Pages that link to "Item:Q1343254"

The following pages link to Relating path coverings to vertex labellings with a condition at distance two (Q1343254):

Displaying 50 items.

• Solutions of some \(L(2, 1)\)-coloring related open problems (Q274676) (← links)
• Backbone coloring for graphs with large girths (Q385734) (← links)
• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
• Group path covering and \(L(j,k)\)-labelings of diameter two graphs (Q413258) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
• On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
• A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
• On critical trees labeled with a condition at distance two (Q556846) (← links)
• On real number labelings and graph invertibility (Q713307) (← links)
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (Q741539) (← links)
• Distance-two labelings of digraphs (Q881579) (← links)
• Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q930929) (← links)
• Distance two labelling and direct products of graphs (Q932631) (← links)
• The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
• On island sequences of labelings with a condition at distance two (Q968105) (← links)
• \(L(2,1)\)-labelings on the composition of \(n\) graphs (Q986562) (← links)
• Labeling graphs with two distance constraints (Q998444) (← links)
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
• Distance-two labellings of Hamming graphs (Q1026152) (← links)
• \(L(2,1)\)-labeling of strong products of cycles (Q1041747) (← links)
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
• No-hole \(L(2,1)\)-colorings (Q1408461) (← links)
• \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
• \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
• A note on collections of graphs with non-surjective lambda labelings (Q1765378) (← links)
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span (Q1786890) (← links)
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
• Distance-two labelings of graphs (Q1869030) (← links)
• Group path covering and distance two labeling of graphs (Q1944096) (← links)
• On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs (Q2012895) (← links)
• Lambda number of the power graph of a finite group (Q2038885) (← links)
• On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
• Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
• Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (Q2352348) (← links)
• Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← links)
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
• An extremal problem on non-full colorable graphs (Q2384400) (← links)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs (Q2413382) (← links)
• Labeling matched sums with a condition at distance two (Q2430056) (← links)
• List backbone colouring of graphs (Q2440098) (← links)
• Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs (Q2457022) (← links)
• The \(L(2,1)\)-labeling on the skew and converse skew products of graphs (Q2463926) (← links)
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs (Q2471059) (← links)
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem (Q2472818) (← links)
• The \(L(2,1)\)-labelling of trees (Q2489954) (← links)