Equating \(\kappa\) maximum degrees in graphs without short cycles

DOI10.7151/dmgt.2152zbMath1439.05051arXiv1705.07409OpenAlexW2962999923WikidataQ129229454 ScholiaQ129229454MaRDI QIDQ2175241

Maximilian Fürst, Dieter Rautenbach, Michael Gentner, Simon Jäger, Michael A. Henning

Publication date: 28 April 2020

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

Full work available at URL: https://arxiv.org/abs/1705.07409

zbMATH Keywords

maximum degreerepeated degreesrepetition number

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items

Large induced subgraphs with three repeated degrees

Cites Work

• Forcing \(k\)-repetitions in degree sequences
• Large induced subgraphs with equated maximum degree
• Repetition number of graphs
• Lower bounds for constant degree independent sets
• Independent sets and repeated degrees
• Equating two maximum degrees