Odd connection and odd vertex-connection of graphs

DOI10.1016/j.disc.2018.09.002zbMath1397.05060OpenAlexW2893985297WikidataQ129181253 ScholiaQ129181253MaRDI QIDQ1800421

Ingo Schiermeyer, Christoph Brause, Stanlislav Jendroľ

Publication date: 23 October 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.09.002

zbMATH Keywords

treesvertex colouringedge colouring2-connected graphsodd connectionodd vertex-connection

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (2)

Loose edge-connection of graphs ⋮ From colourful to rainbow paths in graphs: colouring the vertices

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
• A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
• Rainbow connections of graphs: a survey
• Rainbow connection and forbidden subgraphs
• Proper connection and size of graphs
• Facially-constrained colorings of plane graphs: a survey
• Rainbow connection number and connected dominating sets
• Rainbow connection in graphs

This page was built for publication: Odd connection and odd vertex-connection of graphs