- Sprache
-
Englisch
- Identifier
-
1220837083
Thema
Polynomials; Kombinatorische Graphentheorie; Hochschulschrift
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:58 MEZ
Objekttyp
- Monografie
Beteiligte
- Trinks, Martin
- Schiermeyer, Ingo
- Schiermeyer, Ingo
- Tittmann, Peter
- Tittmann, Peter
Ähnliche Objekte (12)
Combinatorial and graph theoretical aspects of two-edge connected reliability
Graph polynomials and their representations
On combinatorial search problems which involve graphs
Maximale Kantengewichte zusammenhängender Graphen
Homomorphism thresholds and embeddings of spanning subgraphs in dense graphs
Rainbow Colorings in Graphs
On Pairwise Graph Connectivity
Analysis and Optimization of Communication Networks with Flow Requirements
Domination in graphs with application to network reliability
On b-colorings and b-continuity of graphs
Matching Problems with Additional Resource Constraints
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
Combinatorial and graph theoretical aspects of two-edge connected reliability
Graph polynomials and their representations
On combinatorial search problems which involve graphs
Maximale Kantengewichte zusammenhängender Graphen
Homomorphism thresholds and embeddings of spanning subgraphs in dense graphs
Rainbow Colorings in Graphs
On Pairwise Graph Connectivity
Analysis and Optimization of Communication Networks with Flow Requirements
Domination in graphs with application to network reliability
On b-colorings and b-continuity of graphs
Matching Problems with Additional Resource Constraints
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
Combinatorial and graph theoretical aspects of two-edge connected reliability
Graph polynomials and their representations
On combinatorial search problems which involve graphs
Maximale Kantengewichte zusammenhängender Graphen
Homomorphism thresholds and embeddings of spanning subgraphs in dense graphs
Rainbow Colorings in Graphs
On Pairwise Graph Connectivity
Analysis and Optimization of Communication Networks with Flow Requirements
Domination in graphs with application to network reliability
On b-colorings and b-continuity of graphs
Matching Problems with Additional Resource Constraints