Digraphs with proper connection number two
From MaRDI portal
Publication:2034401
Recommendations
Cites work
- A classification of locally semicomplete digraphs
- Classes of directed graphs
- Coloring graphs to produce properly colored walks
- Directed proper connection of graphs
- Hamiltonian paths in \(k\)-quasi-transitive digraphs
- Minimum degree condition for proper connection number 2
- On Subtournaments of a Tournament
- On the (di)graphs with (directed) proper connection number two
- On the existence and number of (k+1)-kings in k-quasi-transitive digraphs
- On the structure of strong 3-quasi-transitive digraphs
- Proper connection of graphs
- Properly colored connectivity of graphs
- Properly colored trails, paths, and bridges
- Proper‐walk connection number of graphs
- Quasi‐transitive digraphs
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)