Equating κ Maximum Degrees in Graphs without Short Cycles
For an integer k at least 2, and a graph G, let fk(G) be the minimum cardinality of a set X of vertices of G such that G − X has either k vertices of maximum degree or order less than k. Caro and Yuster [Discrete Mathematics 310 (2010) 742–747] conjectured that, for every k, there is a constant ck s...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
University of Zielona Góra
2020-08-01
|
| Schriftenreihe: | Discussiones Mathematicae Graph Theory |
| Schlagworte: | |
| Online-Zugang: | https://doi.org/10.7151/dmgt.2152 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|