Upper bounds for some graph invariants in terms of blocks and cut-vertices

DOI10.1016/j.dam.2024.11.020MaRDI QIDQ6657261

M. Zaker

Publication date: 6 January 2025

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

zbMATH Keywords

connectivitychromatic numbergraph invariantsGrundy numbercut-vertexblock-cutpoint graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• First-fit colorings of graphs with no cycles of a prescribed even length
• More bounds for the Grundy number of graphs
• Results on the Grundy chromatic number of graphs
• The number of cutvertices in graphs with given minimum degree
• The least eigenvalue of a graph with cut vertices
• On the number of cut-vertices in a graph
• The number of cut-vertices in a graph of given minimum degree
• Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• Matchings in graphs with a given number of cuts
• The number of blocks of a graph with given minimum degree
• A survey of graph coloring - its types, methods and applications
• New bounds for the chromatic number of graphs
• On-line and first fit colorings of graphs
• The numbers of cut-vertices and end-blocks in 4-regular graphs
• Bounds for the Grundy chromatic number of graphs in terms of domination number
• Cut vertices in random planar maps
• Cut vertices in random planar graphs

This page was built for publication: Upper bounds for some graph invariants in terms of blocks and cut-vertices

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