On proper-path colorings in graphs
From MaRDI portal
Publication:2829346
zbMATH Open1347.05055MaRDI QIDQ2829346FDOQ2829346
Elliot Laforge, Ping Zhang, Chira Lumduanhom, Eric Andrews
Publication date: 27 October 2016
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Cited In (61)
- Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles
- Relations of three classes of disconnected coloring
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
- Some results on (strong) total proper connection number of some digraphs
- Proper colorability of segment intersection graphs
- The proper 2-connection number of several graph classes
- Counting on rainbow \(k\)-connections
- (1, 2)-rainbow connection number at most 3 in connected dense graphs
- Title not available (Why is that?)
- On radio connection number of graphs
- Minimum degree condition for proper connection number 2
- Generalized rainbow connection of graphs
- On the total proper connection of graphs
- Characterizations of graphs having large proper connection numbers
- On the (di)graphs with (directed) proper connection number two
- Minimum degree and size conditions for the proper connection number of graphs
- The proper diameter of a graph
- The proper 2-connection number and size of graphs
- Two sufficient conditions for 2-connected graphs to have proper connection number 2
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicolorful connectivity of trees
- 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
- The rainbow spanning forest problem
- The \((k,\ell )\)-proper index of graphs
- On (strong) proper vertex-connection of graphs
- Colorful paths in vertex coloring of graphs.
- Proper connection of power graphs of finite groups
- Note on directed proper connection number of a random graph
- Conflict-free connections of graphs
- The \(k\)-proper index of graphs
- Complexity results for two kinds of colored disconnections of graphs
- Coloring graphs to produce properly colored walks
- Some results on strong conflict-free connection number of graphs
- Graphs with conflict-free connection number two
- Conflict-free connection number and independence number of a graph
- Conflict-free connection number and size of graphs
- Some upper bounds for the 3-proper index of graphs
- Conflict-free connection number of random graphs
- The proper vertex-disconnection of graphs
- Conflict-free vertex connection number at most 3 and size of graphs
- On the (di)graphs with (directed) proper connection number two
- (Strong) conflict-free connectivity: algorithm and complexity
- Strong conflict-free connection of graphs
- Proper connection and size of graphs
- The conflict-free vertex-connection number and degree conditions of graphs
- On strong proper connection number of cubic graphs
- Hardness results for three kinds of colored connections of graphs
- Properly colored trails, paths, and bridges
- From colourful to rainbow paths in graphs: colouring the vertices
- Properly colored paths and cycles in complete graphs
- Title not available (Why is that?)
- Colorful paths in vertex coloring of graphs
- Proper connection number of bipartite graphs
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
- Proper connection numbers of complementary graphs
- Generalized rainbow connection of graphs and their complements
- Simple proofs of results on paths representing all colors in proper vertex-colorings
- Proper connection number of graph products
This page was built for publication: On proper-path colorings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829346)
