scientific article; zbMATH DE number 7481757
From MaRDI portal
Publication:5037233
DOI10.4134/BKMS.b210153zbMath1484.05185arXiv2111.13919MaRDI QIDQ5037233
Publication date: 28 February 2022
Full work available at URL: https://arxiv.org/abs/2111.13919
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs
- On characterizing radio \(k\)-coloring problem by path covering problem
- On a product dimension of graphs
- A description of claw-free perfect graphs
- Relating path coverings to vertex labellings with a condition at distance two
- 1-tough cocomparability graphs are hamiltonian
- Hamilton cycles in 1-tough triangle-free graphs
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- Path covering number and \(L(2,1)\)-labeling number of graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- A survey on labeling graphs with a condition at distance two
- Hamiltonian cycles in 1-tough graphs
- Tabular graphs and chromatic sum
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Labelling Graphs with a Condition at Distance 2
- Radio Labeling with Preassigned Frequencies
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: