scientific article; zbMATH DE number 6750057

zbMath1462.05159MaRDI QIDQ5279726

Colton Magnant, Pouria Salehi Nowbandegani, Sarabeth Porter, Patrick Ryan Morley, Hua Wang

Publication date: 19 July 2017

Full work available at URL: http://www.emis.de/journals/MV/161/6.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

edge coloringdirected graphproper connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Proper-walk connection of Hamiltonian digraphs ⋮ Coloring graphs to produce properly colored walks ⋮ (Strong) proper vertex connection of some digraphs ⋮ Properly colored trails, paths, and bridges ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Unnamed Item ⋮ Proper connection and proper-walk connection of digraphs ⋮ Note on directed proper connection number of a random graph ⋮ Digraphs with proper connection number two ⋮ (Strong) total proper connection of some digraphs ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two

This page was built for publication: