- Sprache
-
Englisch
- Identifier
-
1259517950
Thema
Graphic methods; Graphfärbung
Beteiligte Personen und Organisationen
Geißer, Maximilian
Schiermeyer, Ingo
Schiermeyer, Ingo
Randerath, Hubert
Schiermeyer, Ingo
Schiermeyer, Ingo
Randerath, Hubert
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
05.07.2022, 13:19 MESZ
Objekttyp
- Monografie
Beteiligte
- Geißer, Maximilian
- Schiermeyer, Ingo
- Schiermeyer, Ingo
- Randerath, Hubert
Ähnliche Objekte (12)
Colourings of P₅-free graphs
Proper connection number of graphs
Introduction to the Minimum Rainbow Subgraph problem
Rainbow Colorings in Graphs
Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity
On Pairwise Graph Connectivity
Random Growth Processes on Graphs
Analysis and Optimization of Communication Networks with Flow Requirements
End space theory for directed and undirected graphs
On some covering, partition and connectivity problems in graphs
On graph sparsity and structure : colourings and graph decompositions
(Relaxed) Product Structures of Graphs and Hypergraphs
Colourings of P₅-free graphs
Proper connection number of graphs
Introduction to the Minimum Rainbow Subgraph problem
Rainbow Colorings in Graphs
Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity
On Pairwise Graph Connectivity
Random Growth Processes on Graphs
Analysis and Optimization of Communication Networks with Flow Requirements
End space theory for directed and undirected graphs
On some covering, partition and connectivity problems in graphs
On graph sparsity and structure : colourings and graph decompositions
(Relaxed) Product Structures of Graphs and Hypergraphs
Colourings of P₅-free graphs
Proper connection number of graphs
Introduction to the Minimum Rainbow Subgraph problem
Rainbow Colorings in Graphs
Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity
On Pairwise Graph Connectivity
Random Growth Processes on Graphs
Analysis and Optimization of Communication Networks with Flow Requirements
End space theory for directed and undirected graphs
On some covering, partition and connectivity problems in graphs
On graph sparsity and structure : colourings and graph decompositions