Reducing the maximum degree of a graph by deleting vertices: the extremal cases

DOI10.20429/tag.2018.050205zbMath1416.05071OpenAlexW2897267149WikidataQ129114586 ScholiaQ129114586MaRDI QIDQ5225550

Kurt Fenech, Peter Borg

Publication date: 22 July 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2018.050205

zbMATH Keywords

dominating set\(\Delta\)-reducing set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (2)

Decreasing the maximum degree of a graph ⋮ Unnamed Item

This page was built for publication: Reducing the maximum degree of a graph by deleting vertices: the extremal cases