Proper connection and proper-walk connection of digraphs

DOI10.1016/J.AMC.2021.126253OpenAlexW3157333978MaRDI QIDQ2245028

Anna Fiedorowicz, Elżbieta Sidorowicz, Eric Sopena

Publication date: 12 November 2021

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

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

zbMATH Keywords

digraphproper connectionarc colouring

Mathematics Subject Classification ID

Graph theory (05Cxx) Communication, information (94Axx) Extremal combinatorics (05Dxx)

Related Items (2)

Proper-walk connection of Hamiltonian digraphs ⋮ (Strong) proper vertex connection of some digraphs

Cites Work

• Unnamed Item
• Proper connection of graphs
• Rainbow connection in oriented graphs
• Rainbow connection in some digraphs
• Coloring graphs to produce properly colored walks
• Total rainbow connection of digraphs
• Rainbow vertex connection of digraphs
• Strong rainbow connection in digraphs
• Properly colored trails, paths, and bridges
• Rainbow connections in digraphs
• Rainbow connections of graphs: a survey
• Note on directed proper connection number of a random graph
• Rainbow connection in graphs
• Properly Colored Connectivity of Graphs

This page was built for publication: Proper connection and proper-walk connection of digraphs