Coloring graphs to produce properly colored walks
From MaRDI portal
Publication:1684944
DOI10.1007/s00373-017-1843-yzbMath1377.05097arXiv1610.04874OpenAlexW2538824066MaRDI QIDQ1684944
Wayne Goddard, Robert Melville
Publication date: 12 December 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.04874
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)
Related Items (8)
Proper-walk connection of Hamiltonian digraphs ⋮ Conflict-free connections of graphs ⋮ Proper‐walk connection number of graphs ⋮ Properly colored trails, paths, and bridges ⋮ Extremal stretch of proper-walk coloring of graphs ⋮ Proper connection and proper-walk connection of digraphs ⋮ Digraphs with proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two
Cites Work
This page was built for publication: Coloring graphs to produce properly colored walks