Properly colored trails, paths, and bridges
type: Item
instance of: scholarly article
title: Properly colored trails, paths, and bridges
zbMATH Open document ID: 1386.05058
author: Wayne Goddard
author: Robert Melville
published in: Journal of Combinatorial Optimization
publication date: 2018-03-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6845576
zbMATH Keywords: edge coloring
zbMATH Keywords: properly colored trails
zbMATH Keywords: path connection number
zbMATH Keywords: bridges
MaRDI profile type: Publication
full work available at URL: s10878-017-0191-4
OpenAlex ID: W2765991567
cites work: On proper-path colorings in graphs
cites work: Proper connection of graphs
cites work: Minimum degree conditions for the proper connection number of graphs
cites work: On the (di)graphs with (directed) proper connection number two
cites work: Minimum degree condition for proper connection number 2
cites work: On two conjectures about the proper connection number of graphs
cites work: Upper bounds of proper connection number of graphs
cites work: Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
cites work: Q5279726
cites work: Coloring graphs to produce properly colored walks
DOI: 10.1007/S10878-017-0191-4
description: scientific article; zbMATH DE number 6845576