More relations between -labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs

DOI10.4134/BKMS.B210153MaRDI QIDQ5037233zbMATH OpenFDO

Publication date 28 February 2022

Full work available at URL https://arxiv.org/abs/2111.13919

Hamiltonian path toughness $L(2,1)$-coloring bipartite multigraphs $\lambda$-labeling

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

On L(2,1)-labelings of Cartesian products of paths and cycles
Group path covering and distance two labeling of graphs
$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
Labelling Graphs with a Condition at Distance 2
Relating path coverings to vertex labellings with a condition at distance two

Cites work

scientific article; zbMATH DE number 1302022 (Why is no real title available?)
scientific article; zbMATH DE number 2044507 (Why is no real title available?)
scientific article; zbMATH DE number 1500531 (Why is no real title available?)
scientific article; zbMATH DE number 1862255 (Why is no real title available?)
scientific article; zbMATH DE number 861334 (Why is no real title available?)
1-tough cocomparability graphs are hamiltonian
A description of claw-free perfect graphs
A survey on labeling graphs with a condition at distance two
Distance two labelings of Cartesian products of complete graphs.
Fixed-parameter complexity of $\lambda$-labelings
Forbidden subgraphs for Hamiltonicity of 1-tough graphs
Hamilton cycles in 1-tough triangle-free graphs
Hamiltonian cycles in 1-tough graphs
Labeling products of complete graphs with a condition at distance two
Labelling Graphs with a Condition at Distance 2
On $L(2,1)$-labeling of generalized Petersen graphs
On L(2,1)-labelings of Cartesian products of paths and cycles
On a product dimension of graphs
On characterizing radio $k$-coloring problem by path covering problem
On some results for the $L(2,1)$-labeling on Cartesian sum graphs.
Path covering number and $L(2,1)$-labeling number of graphs
Radio Labeling with Preassigned Frequencies
Relating path coverings to vertex labellings with a condition at distance two
Tabular graphs and chromatic sum
The $L(2,1)$-labeling on graphs and the frequency assignment problem
$L(2,1)$-labelings of Cartesian products of two cycles

Cited in

(1)

On -fold Rosa-type labelings of bipartite multigraphs

This page was built for publication: More relations between $\lambda $-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037233)