Minimum degree and size conditions for the proper connection number of graphs
type: Item
instance of: scholarly article
title: Minimum degree and size conditions for the proper connection number of graphs
zbMATH Open document ID: 1428.05166
author: Xiaxia Guan
author: Lina Xue
author: Eddie Cheng
author: Weihua Yang
published in: Applied Mathematics and Computation
publication date: 2019-11-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1806.09452
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7137797
zbMATH Keywords: proper connection number
zbMATH Keywords: minimum degree
zbMATH Keywords: edge number
MaRDI profile type: Publication
OpenAlex ID: W2811228059
arXiv ID: 1806.09452
cites work: Proper connection and size of graphs
cites work: On proper-path colorings in graphs
cites work: Proper connection of graphs
cites work: Q3097395
cites work: Rainbow connection in graphs
cites work: Some Theorems on Abstract Graphs
cites work: On maximal paths and circuits of graphs
cites work: On two conjectures about the proper connection number of graphs
cites work: Rainbow connection in sparse graphs
cites work: Graphs with rainbow connection number two
cites work: Rainbow vertex connection of digraphs
cites work: Total rainbow connection of digraphs
cites work: Rainbow connection number of dense graphs
cites work: Rainbow connections of graphs: a survey
cites work: Note on Hamilton Circuits
cites work: Rainbow Connection in Graphs with Minimum Degree Three
cites work: Maximal circuits of graphs. I
DOI: 10.1016/J.AMC.2019.01.062
Wikidata QID: Q128311050
description: scientific article