- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Matching Cut in Graphs with Large Minimum Degree ; day:23 ; month:11 ; year:2020 ; pages:1-18
Algorithmica ; (23.11.2020), 1-18
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-020-00782-8
- URN
-
urn:nbn:de:101:1-2021010319544486907199
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 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
- Chen, Chi-Yeh
- Hsieh, Sun-Yuan
- Le, Hoang-Oanh
- Le, Van Bang
- Peng, Sheng-Lung
- SpringerLink (Online service)
Other Objects (12)
Minimum Degree Stability of H-Free Graphs
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
On the minimum degree of minimal Ramsey graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Minimum Cut Tree Games
Non-solvable groups whose character degree graph has a cut-vertex. III
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Degree heuristics for matching
Degree heuristics for matching
Minimum Fundamental Cut Basis Problem
Minimum Cut Bases in Undirected Networks
Cut problems on graphs
Minimum Degree Stability of H-Free Graphs
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
On the minimum degree of minimal Ramsey graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Minimum Cut Tree Games
Non-solvable groups whose character degree graph has a cut-vertex. III
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Degree heuristics for matching
Degree heuristics for matching
Minimum Fundamental Cut Basis Problem
Minimum Cut Bases in Undirected Networks
Cut problems on graphs
Minimum Degree Stability of H-Free Graphs
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
On the minimum degree of minimal Ramsey graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Minimum Cut Tree Games
Non-solvable groups whose character degree graph has a cut-vertex. III
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Degree heuristics for matching
Degree heuristics for matching
Minimum Fundamental Cut Basis Problem
Minimum Cut Bases in Undirected Networks