Decreasing the maximum degree of a graph

DOI10.1016/j.disc.2022.112994zbMath1495.05032OpenAlexW4282016561WikidataQ114190512 ScholiaQ114190512MaRDI QIDQ2166269

Peter Borg

Publication date: 24 August 2022

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

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

zbMATH Keywords

regular graphdominating setmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Introduction to ``Topics on Domination
• Bibliography on domination in graphs and some basic definitions of domination parameters
• A survey of selected recent results on total domination in graphs
• An upper bound on the domination number of \(n\)-vertex connected cubic graphs
• Independent domination in graphs: A survey and recent results
• A new bound on the domination number of connected cubic graphs
• Domination in graphs of minimum degree five
• On domination in connected cubic graphs
• Domination in graphs with minimum degree two
• DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
• Towards a theory of domination in graphs
• Paths, Stars and the Number Three
• Total Domination in Graphs
• Reducing the maximum degree of a graph by deleting vertices: the extremal cases

This page was built for publication: Decreasing the maximum degree of a graph