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

DOI10.20429/TAG.2018.050205zbMATH Open1416.05071OpenAlexW2897267149WikidataQ129114586 ScholiaQ129114586MaRDI QIDQ5225550FDOQ5225550

Authors: Peter Borg, Kurt Fenech 

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

Recommendations

• Reducing the maximum degree of a graph by deleting vertices
• scientific article; zbMATH DE number 7057487
• Reducing the maximum degree of a graph: comparisons of bounds
• Maximal trees with bounded maximum degree in a graph
• Decreasing the maximum degree of a graph

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)

Cited In (6)

• Reducing the maximum degree of a graph by deleting vertices
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
• Decreasing the maximum degree of a graph
• Reducing the maximum degree of a graph: comparisons of bounds
• A Turán-type generalization of Tuza's triangle edge cover problem
• Title not available (Why is that?)

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

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