- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
Minimum Degree Stability of H-Free Graphs ; volume:43 ; number:1 ; day:12 ; month:5 ; year:2023 ; pages:129-147 ; date:2.2023
Combinatorica ; 43, Heft 1 (12.5.2023), 129-147, 2.2023
- Creator
-
Illingworth, Freddie
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00493-023-00010-1
- URN
-
urn:nbn:de:101:1-2023110108343902268893
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Illingworth, Freddie
- SpringerLink (Online service)
Other Objects (12)
On the minimum degree of minimal Ramsey graphs
Matching Cut in Graphs with Large Minimum Degree
Degree-constrained editing of small-degree graphs
Degree-constrained editing of small-degree graphs
Minimum color-degree perfect b-matchings
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
A Note on Stability for Maximal F-Free Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Minimum-width graph layering revisited
Chemical Distance in Geometric Random Graphs with Long Edges and Scale-Free Degree Distribution
Envy-free division using mapping degree.
Highest degree of price stability since 1959
On the minimum degree of minimal Ramsey graphs
Matching Cut in Graphs with Large Minimum Degree
Degree-constrained editing of small-degree graphs
Degree-constrained editing of small-degree graphs
Minimum color-degree perfect b-matchings
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
A Note on Stability for Maximal F-Free Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Minimum-width graph layering revisited
Chemical Distance in Geometric Random Graphs with Long Edges and Scale-Free Degree Distribution
Envy-free division using mapping degree.
Highest degree of price stability since 1959
On the minimum degree of minimal Ramsey graphs
Matching Cut in Graphs with Large Minimum Degree
Degree-constrained editing of small-degree graphs
Degree-constrained editing of small-degree graphs
Minimum color-degree perfect b-matchings
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
A Note on Stability for Maximal F-Free Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Minimum-width graph layering revisited
Chemical Distance in Geometric Random Graphs with Long Edges and Scale-Free Degree Distribution
Envy-free division using mapping degree.