Proper-walk connection of Hamiltonian digraphs

DOI10.1016/J.AMC.2022.127169MaRDI QIDQ2141233zbMATH OpenOpenAlexWikidataFDO

Authors Baoyindureng Wu, Zhenzhen Li

Publication date 23 May 2022

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

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

zbMATH Keywords

Hamiltonian digraphproper-walk connection

Mathematics Subject Classification ID

Combinatorics (05-XX) Graph theory (05Cxx) Combinatorial probability (60Cxx)

Recommendations

• Proper connection and proper-walk connection of digraphs
• Proper‐walk connection number of graphs
• Coloring graphs to produce properly colored walks
• On the (di)graphs with (directed) proper connection number two
• On the (di)graphs with (directed) proper connection number two

Cites work

• Coloring graphs to produce properly colored walks
• Digraphs with proper connection number two
• Directed proper connection of graphs
• Note on directed proper connection number of a random graph
• On the (di)graphs with (directed) proper connection number two
• Proper connection and proper-walk connection of digraphs
• Proper connection of graphs
• Properly colored connectivity of graphs
• Properly colored trails, paths, and bridges

Cited in

(1)

• Proper connection and proper-walk connection of digraphs

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

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