Properly Colored Connectivity of Graphs

DOI10.1007/978-3-319-89617-5zbMath1475.05002OpenAlexW2804497917MaRDI QIDQ4636339

Zhongmei Qin, Colton Magnant, Xue Liang Li

Publication date: 23 April 2018

Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89617-5

zbMATH Keywords

proper connection numbertotal proper connectionproperly connected graphsstrong proper connectionproper path coloring

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (20)

Proper-walk connection of Hamiltonian digraphs ⋮ Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ (Strong) proper vertex connection of some digraphs ⋮ Conflict-free connection number of random graphs ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Monochromatic disconnection of graphs ⋮ Unnamed Item ⋮ On conflict-free connection of graphs ⋮ Matrix approach to formulate and search \(k\)-ESS of graphs using the STP theory ⋮ Extremal stretch of proper-walk coloring of graphs ⋮ Proper connection and proper-walk connection of digraphs ⋮ On the total proper connection of graphs ⋮ Conflict-free connection number and independence number of a graph ⋮ The \((k,\ell )\)-proper index of graphs ⋮ Note on directed proper connection number of a random graph ⋮ (Strong) conflict-free connectivity: algorithm and complexity ⋮ Digraphs with proper connection number two ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems ⋮ Conflict-free connection of trees

This page was built for publication: Properly Colored Connectivity of Graphs