Extremal stretch of proper-walk coloring of graphs

DOI10.1016/J.AMC.2021.126240MaRDI QIDQ2243237zbMATH OpenOpenAlexFDO

Authors Zhongmei Qin, Junxue Zhang

Publication date 11 November 2021

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2021.126240

zbMATH Keywords

pathproper connected coloringstretchtrailwalk

Mathematics Subject Classification ID

Combinatorics (05-XX) Graph theory (05Cxx)

Recommendations

• Coloring graphs to produce properly colored walks
• Proper‐walk connection number of graphs
• Proper connection number of graph products
• On proper-path colorings in graphs
• Proper connection with many colors

Cites work

• Coloring graphs to produce properly colored walks
• Graph theory
• On the complexity of \(k\)-rainbow cycle colouring problems
• Proper connection of graphs
• Properly colored connectivity of graphs
• Properly colored trails, paths, and bridges
• Proper‐walk connection number of graphs

Cited in

(3)

• Coloring graphs to produce properly colored walks
• Properly colored trails, paths, and bridges
• Proper‐walk connection number of graphs

This page was built for publication: Extremal stretch of proper-walk coloring of graphs

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