Relating path coverings to vertex labellings with a condition at distance two
From MaRDI portal
Publication:1343254
DOI10.1016/0012-365X(93)E0098-OzbMath0811.05058MaRDI QIDQ1343254
David W. Mauro, Marshall A. Whittlesey, John P. Georges
Publication date: 1 February 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)
Related Items (64)
Solutions of some \(L(2, 1)\)-coloring related open problems ⋮ Extremal problems on consecutive \(L(2,1)\)-labelling ⋮ The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ An extremal problem on non-full colorable graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Distance-two labelings of digraphs ⋮ Backbone coloring for graphs with large girths ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ On the universality and extremality of graphs with a distance constrained colouring ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ Group path covering and \(L(j,k)\)-labelings of diameter two graphs ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ Group path covering and distance two labeling of graphs ⋮ Labeling matched sums with a condition at distance two ⋮ No-hole \(L(2,1)\)-colorings ⋮ On the \(L(2,1)\)-labelings of amalgamations of graphs ⋮ Radio k-chromatic number of cycles for large k ⋮ List backbone colouring of graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ Distance two labelling and direct products of graphs ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ Unnamed Item ⋮ On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ The \(L(2,1)\)-labeling on the skew and converse skew products of graphs ⋮ On a distance-constrained graph labeling to model cooperation ⋮ A note on \(L (2, 1)\)-labelling of trees ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ The \(L(2,1)\)-labeling on Cartesian sum of graphs ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s ⋮ Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers ⋮ On island sequences of labelings with a condition at distance two ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ The \(L(2,1)\)-labelling of trees ⋮ On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ On critical trees labeled with a condition at distance two ⋮ On real number labelings and graph invertibility ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ Fixed-parameter complexity of \(\lambda\)-labelings ⋮ \(L(2,1)\)-labelings on the composition of \(n\) graphs ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span ⋮ On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices ⋮ Labeling graphs with two distance constraints ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths ⋮ Lambda number of the power graph of a finite group ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Nontrivial path covers of graphs: existence, minimization and maximization ⋮ Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE ⋮ Distance-two labellings of Hamming graphs ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ \(L(2,1)\)-labeling of strong products of cycles ⋮ Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles ⋮ Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs ⋮ \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs ⋮ Distance-two labelings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- No-hole \((r+1)\)-distant colorings
- Arc coverings of graphs
- \(T\)-colorings of graphs: recent results and open problems
- Covering the vertices of a graph by vertex-disjoint paths
- Labelling Graphs with a Condition at Distance 2
- Hamiltonian circuits and path coverings of vertices in graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Relating path coverings to vertex labellings with a condition at distance two
