No-hole (r+1)-distant colorings
From MaRDI portal
Publication:688267
DOI10.1016/0012-365X(93)90125-DzbMATH Open0796.05042MaRDI QIDQ688267FDOQ688267
Publication date: 15 September 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- On the compatibility between a graph and a simple order
- Note on Hamilton Circuits
- \(T\)-colorings of graphs: recent results and open problems
- Parallel concepts in graph theory
- Two-Processor Scheduling with Start-Times and Deadlines
- Neighbourhood unions and Hamiltonian properties in graphs
- List \(T\)-colorings of graphs
- Pair Labellings with Given Distance
- No-hole 2-distant colorings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- On irreducible no‐hole L(2, 1)‐coloring of trees
- No-hole 2-distant colorings
- Distance-constrained labellings of Cartesian products of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal problems on consecutive \(L(2,1)\)-labelling
- \(T\)-colorings of graphs: recent results and open problems
- Relating path coverings to vertex labellings with a condition at distance two
- No-hole \(L(2,1)\)-colorings
- Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs
- Anti-\(k\)-labeling of graphs
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
- Distance-two labellings of Hamming graphs
- Channel assignment problem and relaxed 2-distant coloring of graphs
- No-hole \(k\)-tuple \((r+1)\)-distant colorings
- No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles
Recommendations
This page was built for publication: No-hole \((r+1)\)-distant colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688267)
