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
John P. Georges, David W. Mauro, Marshall A. Whittlesey
Publication date: 1 February 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
05C38: Paths and cycles
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Fixed-parameter complexity of \(\lambda\)-labelings, On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs, Solutions of some \(L(2, 1)\)-coloring related open problems, Backbone coloring for graphs with large girths, 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, Randomly colouring graphs (a combinatorial view), The minimum span of \(L(2,1)\)-labelings of generalized flowers, On characterizing radio \(k\)-coloring problem by path covering problem, A note on \(L (2, 1)\)-labelling of trees, 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, Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two, Distance-two labelings of digraphs, 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 \(L(2,1)\)-labeling on Cartesian sum of graphs, On island sequences of labelings with a condition at distance two, \(L(2,1)\)-labelings on the composition of \(n\) graphs, Labeling graphs with two distance constraints, On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path, Distance-two labellings of Hamming graphs, \(L(2,1)\)-labeling of strong products of cycles, Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers, No-hole \(L(2,1)\)-colorings, \(L(2,1)\)-labeling of direct product of paths and cycles, A note on collections of graphs with non-surjective lambda labelings, On \(L(2,1)\)-labelings of Cartesian products of paths and cycles, Distance-two labelings of graphs, Group path covering and distance two labeling of graphs, On the \(L(2,1)\)-labelings of amalgamations of graphs, On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs, Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers, \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs, 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, Labeling matched sums with a condition at distance two, List backbone colouring of graphs, Path covering number and \(L(2,1)\)-labeling number of graphs, On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs, The \(L(2,1)\)-labeling on the skew and converse skew products of graphs, \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs, The \(L(2,1)\)-labeling on graphs and the frequency assignment problem, The \(L(2,1)\)-labelling of trees, \(L(2,1)\)-labelings of Cartesian products of two cycles, A survey on labeling graphs with a condition at distance two, Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles, On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices, Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
