Digraphs with proper connection number two

DOI10.1016/J.TCS.2021.04.025zbMath1504.05109OpenAlexW3157517202MaRDI QIDQ2034401

Luyi Li, Xue Liang Li

Publication date: 22 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.025

zbMATH Keywords

algorithmic complexityproper connection numberarc-colored (strong) digraphproper connectedness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

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

Cites Work

• Unnamed Item
• Hamiltonian paths in \(k\)-quasi-transitive digraphs
• On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
• Proper connection of graphs
• On the structure of strong 3-quasi-transitive digraphs
• A classification of locally semicomplete digraphs
• Coloring graphs to produce properly colored walks
• Properly colored trails, paths, and bridges
• Minimum degree condition for proper connection number 2
• Classes of Directed Graphs
• Properly Colored Connectivity of Graphs
• Quasi‐transitive digraphs
• On Subtournaments of a Tournament
• On the (di)graphs with (directed) proper connection number two
• Proper‐walk connection number of graphs

This page was built for publication: Digraphs with proper connection number two