Digraphs with proper connection number two
From MaRDI portal
Publication:2034401
DOI10.1016/J.TCS.2021.04.025zbMATH Open1504.05109OpenAlexW3157517202MaRDI QIDQ2034401FDOQ2034401
Authors: LuYi Li, Xueliang 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- A classification of locally semicomplete digraphs
- On Subtournaments of a Tournament
- Hamiltonian paths in \(k\)-quasi-transitive digraphs
- On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
- Quasi‐transitive digraphs
- Proper connection of graphs
- On the structure of strong 3-quasi-transitive digraphs
- Properly colored connectivity of graphs
- Classes of directed graphs
- Coloring graphs to produce properly colored walks
- Directed proper connection of graphs
- Properly colored trails, paths, and bridges
- Minimum degree condition for proper connection number 2
- Proper‐walk connection number of graphs
- On the (di)graphs with (directed) proper connection number two
Cited In (8)
- On the (di)graphs with (directed) proper connection number two
- (Strong) proper vertex connection of some digraphs
- Proper-walk connection of Hamiltonian digraphs
- Proper connection and proper-walk connection of digraphs
- Some results on (strong) total proper connection number of some digraphs
- (Strong) total proper connection of some digraphs
- Directed proper connection of graphs
- Directed proper connection number and almost spanning subgraphs.
This page was built for publication: Digraphs with proper connection number two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034401)
