DSpace Repository

Browsing by Author "Laforge E."

Browsing by Author "Laforge E."

Sort by: Order: Results:

  • Characterizations of graphs having large proper connection numbers 
    Lumduanhom C.; Laforge E.; Zhang P. (2016)
    Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of P are colored the same. If P is a proper u-v path of length d(u,v), then P is a proper u, - v geodesic. An edge coloring ...
  • On proper-path colorings in graphs 
    Andrews E.; Lumduanhom C.; Laforge E.; Zhang P. (2016)
    Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of P are colored the same. If P is a proper u - v path of length d(u, v), then P is a proper u - v geodesic. An edge coloring ...
  • Proper-path colorings in graph operations 
    Andrews E.; Laforge E.; Lumduanhom C.; Zhang P. (2016)
    Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of P are colored the same. An edge coloring is a proper-path coloring of G if every pair u, v of distinct vertices of G are ...