Total rainbow connection number and complementary graph
From MaRDI portal
Publication:310863
DOI10.1007/S00025-015-0469-8zbMATH Open1344.05064OpenAlexW1156767371MaRDI QIDQ310863FDOQ310863
Authors: Yingbin Ma 
Publication date: 8 September 2016
Published in: Results in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00025-015-0469-8
Recommendations
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
- Some upper bounds for the total-rainbow connection number of graphs.
- The total-rainbow \(k\)-connection of 2-connected graphs.
- Upper bounds for the total rainbow connection of graphs
- On total rainbow \(k\)-connected graphs
triangle-freecomplementary graphNordhaus-Gaddum-typerainbow vertex connectedtotal rainbow connectedtotal rainbow pathtotal-coloringvertex rainbow pathvertex-coloring
Cites Work
- Graph theory
- Rainbow connections of graphs
- Rainbow connection in graphs
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The complexity of determining the rainbow vertex-connection of a graph
- On the rainbow vertex-connection
- Total rainbow \(k\)-connection in graphs
- The strong rainbow vertex-connection of graphs
- A survey of Nordhaus-Gaddum type relations
- On Complementary Graphs
- Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
- Rainbow connection numbers of complementary graphs
- Graphs with vertex rainbow connection number two
Cited In (15)
- Rainbow connection numbers of complementary graphs
- Title not available (Why is that?)
- Some results on the total proper \(k\)-connection number
- Some results on the 3-total-rainbow index
- Graphs with small total rainbow connection number
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number
- Title not available (Why is that?)
- Total-rainbow connection and forbidden subgraphs
- Some results on the 3-vertex-rainbow index of a graph
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
- Rainbow connection number and independence number of a graph
- Rainbow connection number and connected dominating sets
- On various (strong) rainbow connection numbers of graphs
- Rainbow vertex connection numbers and total rainbow connection numbers of middle and total graphs.
- Total rainbow connection numbers of some special graphs
This page was built for publication: Total rainbow connection number and complementary graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q310863)
