Properly colored connectivity of graphs

DOI10.1007/978-3-319-89617-5MaRDI QIDQ4636339zbMATH OpenOpenAlexFDO

Authors Colton Magnant, Zhongmei Qin, Xueliang 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 numberproper path coloringproperly connected graphsstrong proper connectiontotal proper connection

Mathematics Subject Classification ID

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

Recommendations

• Proper connection with many colors
• Proper connection number 2, connectivity, and forbidden subgraphs
• Proper connection and size of graphs
• Proper connection of graphs
• Directed proper connection of graphs

Cited in

(27)

• On conflict-free connection of graphs
• Conflict-free connection number and independence number of a graph
• Digraphs with proper connection number two
• Matrix formulation of EISs of graphs and its application to WSN covering problems
• Conflict-free connection of trees
• Proper-walk connection of Hamiltonian digraphs
• Two sufficient conditions for 2-connected graphs to have proper connection number 2
• Conflict-free connection number of random graphs
• Hardness results for three kinds of colored connections of graphs
• Monochromatic disconnection 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
• Note on directed proper connection number of a random graph
• (Strong) conflict-free connectivity: algorithm and complexity
• scientific article; zbMATH DE number 1146221 (Why is no real title available?)
• Coloring Graphs with Constraints on Connectivity
• Proper coloring distance in edge-colored Cartesian products of complete graphs and cycles
• (Strong) proper vertex connection of some digraphs
• On the number of \(k\)-proper connected edge and vertex colorings of graphs
• Proper colorability of segment intersection graphs
• Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph.
• Some results on (strong) total proper connection number of some digraphs
• Strongly proper connected coloring of graphs
• The \((k,\ell )\)-proper index of graphs
• Properties of algebraically defined edge-colored graphs

This page was built for publication: Properly colored connectivity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636339)