On P vertex-connections of graphs

DOI10.7151/DMGT.2545MaRDI QIDQ6985849zbMATH OpenFDO

Authors Július Czap, Stanislav Jendroľ, Peter Šugerek

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2545

zbMATH Keywords

edge coloringpconnectionpvertex-connectionvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• Colorful monochromatic connectivity
• Conflict-free connections of graphs
• Conflict-free vertex connection number at most 3 and size of graphs
• Conflict-free vertex-connections of graphs
• Maximum value of conflict-free vertex-connection number of graphs
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of trees
• Nonrepetitive colouring via entropy compression
• Nonrepetitive graph colouring
• Note on vertex and total proper connection numbers
• Odd connection and odd vertex-connection of graphs
• Planar graphs have bounded nonrepetitive chromatic number
• Proper connection of graphs
• Rainbow connection in graphs
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph
• The conflict-free vertex-connection number and degree conditions of graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Über unendliche Zeichenreihen.

This page was built for publication: On \(\mathcal{P}\) vertex-connections of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985849)