Proper connection of graphs
type: Item
instance of: scholarly article
title: Proper connection of graphs
zbMATH Open document ID: 1246.05090
author: V. Borozan
author: Shinya Fujita
author: Aydin Gerek
author: Colton Magnant
author: Y. Manoussakis
author: Leandro Montero
author: Zsolt Tuza
published in: Discrete Mathematics
publication date: 2012-08-10T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6064670
zbMATH Keywords: proper coloring
zbMATH Keywords: proper connection
MaRDI profile type: Publication
full work available at URL: j.disc.2011.09.003
OpenAlex ID: W2083641445
cites work: Cycles and paths in edge‐colored graphs with given degrees
cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey
cites work: On rainbow connection
cites work: Q5443277
cites work: Rainbow connection in graphs
cites work: Rainbow paths
cites work: Some Theorems on Abstract Graphs
cites work: Relative length of long paths and cycles in graphs with large degree sums
cites work: Properly colored paths and cycles
cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree
cites work: On relative length of longest paths and cycles
cites work: A characterization of Hamiltonian prisms
cites work: On minimally rainbow \(k\)-connected graphs
cites work: Color degree and alternating cycles in edge-colored graphs
cites work: Panconnected graphs. II
DOI: 10.1016/J.DISC.2011.09.003
description: scientific article; zbMATH DE number 6064670