On the minimum degree and the proper connection number of graphs
type: Item
instance of: scholarly article
title: On the minimum degree and the proper connection number of graphs
zbMATH Open document ID: 1356.05074
author: Christoph Brause
author: Trung Duy Doan
author: Ingo Schiermeyer
publication date: 2017-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6684452
zbMATH Keywords: proper connection number
zbMATH Keywords: 2-connected
zbMATH Keywords: minimum degree
MaRDI profile type: Publication
full work available at URL: j.endm.2016.10.028
OpenAlex ID: W2556031989
cites work: Proper connection of graphs
cites work: Q5572939
cites work: Long cycles in bipartite graphs
cites work: A characterization of Hamiltonian prisms
DOI: 10.1016/J.ENDM.2016.10.028
Recommended article: Minimum degree conditions for the proper connection number of graphs
Recommended article: Minimum degree and size conditions for the proper connection number of graphs
Recommended article: On two conjectures about the proper connection number of graphs
Recommended article: Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
Recommended article: On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Recommended article: Degree sums and proper connection number of graphs
Recommended article: Q4878669
Recommended article: Q3356329
Recommended article: On minimally \((n,\lambda)\)-connected graphs
Recommended article: Q4781518
description: scientific article; zbMATH DE number 6684452