Properly colored trails, paths, and bridges

DOI10.1007/s10878-017-0191-4zbMath1386.05058OpenAlexW2765991567MaRDI QIDQ1702827

Wayne Goddard, Robert Melville

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0191-4

zbMATH Keywords

edge coloringbridgesproperly colored trailspath connection number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Proper-walk connection of Hamiltonian digraphs, Proper‐walk connection number of graphs, Extremal stretch of proper-walk coloring of graphs, Proper connection and proper-walk connection of digraphs, Digraphs with proper connection number two

Cites Work

• Proper connection of graphs
• Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
• Coloring graphs to produce properly colored walks
• On two conjectures about the proper connection number of graphs
• Minimum degree conditions for the proper connection number of graphs
• Upper bounds of proper connection number of graphs
• Minimum degree condition for proper connection number 2
• On the (di)graphs with (directed) proper connection number two
• Unnamed Item
• Unnamed Item