- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1435-5914
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
An Erdős-Gallai type theorem for vertex colored graphs ; day:9 ; month:3 ; year:2019 ; pages:1-6
Graphs and combinatorics ; (9.3.2019), 1-6
- Creator
-
Salia, Nika
Tompkins, Casey
Zamora, Oscar
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00373-019-02026-1
- URN
-
urn:nbn:de:101:1-2019040321275911176859
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:52 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
- Salia, Nika
- Tompkins, Casey
- Zamora, Oscar
- SpringerLink (Online service)
Other Objects (12)
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
Dynamic vertex colored conflict graphs for time-sensitive networks
Vertex maps on graphs-trace theorems
Colored vertex models and Iwahori Whittaker functions
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Weighted independent colorful sets in large vertex colored conflict graphs for timetriggered flow scheduling
Vertex rough graphs
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph
Vertex models on random graphs
Vertex labellings of simple graphs
Vertex reconstruction in Cayley graphs
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
Dynamic vertex colored conflict graphs for time-sensitive networks
Vertex maps on graphs-trace theorems
Colored vertex models and Iwahori Whittaker functions
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Weighted independent colorful sets in large vertex colored conflict graphs for timetriggered flow scheduling
Vertex rough graphs
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph
Vertex models on random graphs
Vertex labellings of simple graphs
Vertex reconstruction in Cayley graphs
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
Dynamic vertex colored conflict graphs for time-sensitive networks
Vertex maps on graphs-trace theorems
Colored vertex models and Iwahori Whittaker functions
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Weighted independent colorful sets in large vertex colored conflict graphs for timetriggered flow scheduling
Vertex rough graphs
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph
Vertex models on random graphs
Vertex labellings of simple graphs