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

DOI10.4134/BKMS.B210153zbMATH Open1484.05185arXiv2111.13919MaRDI QIDQ5037233FDOQ5037233

Authors: Manouchehr Zaker 

Publication date: 28 February 2022

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

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

zbMATH Keywords

Hamiltonian pathtoughness\(L(2,1)\)-coloringbipartite multigraphs\(\lambda\)-labeling

Mathematics Subject Classification ID

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)

Cites Work

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

Cited In (1)

• On \(\lambda\)-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)