Digraphs with proper connection number two
type: Item
instance of: scholarly article
title: Digraphs with proper connection number two
zbMATH Open document ID: 1504.05109
author: LuYi Li
author: Xueliang Li
published in: Theoretical Computer Science
publication date: 2021-06-22T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7361600
zbMATH Keywords: arc-colored (strong) digraph
zbMATH Keywords: proper connectedness
zbMATH Keywords: proper connection number
zbMATH Keywords: algorithmic complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.04.025
OpenAlex ID: W3157517202
cites work: Proper‐walk connection number of graphs
cites work: A classification of locally semicomplete digraphs
cites work: Classes of Directed Graphs
cites work: Quasi‐transitive digraphs
cites work: Proper connection of graphs
cites work: On the (di)graphs with (directed) proper connection number two
cites work: On the structure of strong 3-quasi-transitive digraphs
cites work: On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
cites work: Minimum degree condition for proper connection number 2
cites work: Properly Colored Connectivity of Graphs
cites work: Q5279726
cites work: Coloring graphs to produce properly colored walks
cites work: Properly colored trails, paths, and bridges
cites work: On Subtournaments of a Tournament
cites work: Hamiltonian paths in \(k\)-quasi-transitive digraphs
DOI: 10.1016/J.TCS.2021.04.025
description: scientific article; zbMATH DE number 7361600