Proper connection and size of graphs
From MaRDI portal
Publication:2401802
DOI10.1016/J.DISC.2016.09.021zbMATH Open1369.05088OpenAlexW2549843525MaRDI QIDQ2401802FDOQ2401802
Authors: Christoph Brause, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer, Susan Van Aardt, A. P. Burger 
Publication date: 5 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.021
Recommendations
Cites Work
- On maximal paths and circuits of graphs
- Note on Hamilton Circuits
- Rainbow connection in graphs
- Maximal circuits of graphs. I
- On proper-path colorings in graphs
- Rainbow connection in graphs with minimum degree three
- Graphs with rainbow connection number two
- Rainbow connection number of dense graphs
- Rainbow connection in sparse graphs
- Proper connection of graphs
Cited In (33)
- Proper connection with many colors
- Characterizations of graphs having large proper connection numbers
- Minimum degree and size conditions for the proper connection number of graphs
- The proper 2-connection number and size of graphs
- Minimum degree conditions for the proper connection number of graphs
- Upper bounds of proper connection number of graphs
- Some results on the total proper \(k\)-connection number
- Proper connection number of random graphs
- Proper connection number of bipartite graphs.
- Note on minimum degree and proper connection number
- On Graphs with Proper Connection Number 2
- Conflict-free connections of graphs
- Proper disconnection of graphs
- Sharp Nordhaus-Gaddum-type lower bounds for proper connection numbers of graphs
- Graphs with conflict-free connection number two
- Properly colored connectivity of graphs
- The proper 2-connection number of several graph classes
- Proper connection of graphs
- Conflict-free connection number and size of graphs
- Proper Hamiltonian-connected graphs
- Conflict-free vertex connection number at most 3 and size of graphs
- Odd connection and odd vertex-connection of graphs
- List proper connection of 2-edge-connected graphs
- The proper (vertex) connection numbers of cubic graphs
- Bounds for proper \(k\)-connectivity of complete bipartite graphs
- On color-connected graphs
- Proper connection of direct products
- On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2
- The optimal proper connection number of a graph with given independence number
- From colourful to rainbow paths in graphs: colouring the vertices
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
- Proper connection numbers of complementary graphs
- Loose edge-connection of graphs
This page was built for publication: Proper connection and size of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401802)
