From colourful to rainbow paths in graphs: colouring the vertices

DOI10.1007/S00373-021-02322-9zbMath1482.05097OpenAlexW3161401653MaRDI QIDQ2051888

Christoph Brause, Ingo Schiermeyer, Stanlislav Jendroľ

Publication date: 25 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02322-9

zbMATH Keywords

rainbow vertex-connection numbervertex colourings\(k\)-colourful vertex-connection number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Loose edge-connection of graphs

Cites Work

• Proper connection of graphs
• On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
• Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
• Conflict-free connections of graphs
• Graphs with conflict-free connection number two
• Odd connection and odd vertex-connection of graphs
• Rainbow connections of graphs: a survey
• Rainbow connection and forbidden subgraphs
• Proper connection and size of graphs
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: From colourful to rainbow paths in graphs: colouring the vertices