Some results on (strong) total proper connection number of some digraphs
type: Item
instance of: scholarly article
title: Some results on (strong) total proper connection number of some digraphs
zbMATH Open document ID: 1547.05108
author: Yingbin Ma
author: Mingli Wang
author: Wei Zhao
author: Kairui Nie
published in: Discrete Applied Mathematics
publication date: 2024-09-26T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7919052
zbMATH Keywords: total-coloring
zbMATH Keywords: (strong) total proper connected
zbMATH Keywords: (strong) total proper connection number
MaRDI profile type: Publication
cites work: On proper-path colorings in graphs
cites work: Digraphs
cites work: Quasi‐transitive digraphs
cites work: The Colour Numbers of Complete Graphs
cites work: Proper connection of graphs
cites work: Note on vertex and total proper connection numbers
cites work: Rainbow connection in oriented graphs
cites work: On the (di)graphs with (directed) proper connection number two
cites work: Proper connection and proper-walk connection of digraphs
cites work: Note on directed proper connection number of a random graph
cites work: Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter
cites work: Proper connection numbers of complementary graphs
cites work: On strong proper connection number of cubic graphs
cites work: On the total proper connection of graphs
cites work: On (strong) proper vertex-connection of graphs
cites work: Rainbow vertex connection of digraphs
cites work: Total rainbow connection of digraphs
cites work: Digraphs with proper connection number two
cites work: Nordhaus-Gaddum-type theorem for total-proper connection number of graphs
cites work: Properly Colored Connectivity of Graphs
cites work: (Strong) total proper connection of some digraphs
cites work: Q5279726
cites work: On Subtournaments of a Tournament
cites work: (Strong) proper vertex connection of some digraphs
cites work: Hamiltonian paths in \(k\)-quasi-transitive digraphs
DOI: 10.1016/J.DAM.2024.06.036
description: scientific article; zbMATH DE number 7919052