(Strong) total proper connection of some digraphs

DOI10.1007/S10878-021-00738-WzbMath1470.05067OpenAlexW3152756815MaRDI QIDQ2045035

Yingbin Ma, Kairui Nie

Publication date: 11 August 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00738-w

zbMATH Keywords

\(stpc\)-number\(tpc\)-numbertotal proper geodesictotal proper path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Total rainbow \(k\)-connection in graphs
• Proper connection of graphs
• Rainbow connection in oriented graphs
• Rainbow connection in some digraphs
• Rainbow connectivity of cacti and of some infinite digraphs
• Total rainbow connection of digraphs
• On (strong) proper vertex-connection of graphs
• Rainbow vertex connection of digraphs
• Rainbow connections of graphs: a survey
• On the total proper connection of graphs
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Digraphs
• On the (di)graphs with (directed) proper connection number two

This page was built for publication: (Strong) total proper connection of some digraphs