- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0444
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Proper Coloring of Geometric Hypergraphs ; volume:62 ; number:3 ; day:15 ; month:5 ; year:2019 ; pages:674-689 ; date:10.2019
Discrete & computational geometry ; 62, Heft 3 (15.5.2019), 674-689, 10.2019
- Urheber
-
Keszegh, Balázs
Pálvölgyi, Dömötör
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00454-019-00096-9
- URN
-
urn:nbn:de:101:1-2020012121100832195754
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:55 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Keszegh, Balázs
- Pálvölgyi, Dömötör
- SpringerLink (Online service)
Ähnliche Objekte (12)
Coloring Intersection Hypergraphs of Pseudo-Disks
Strongly Proper Connected Coloring of Graphs
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz
Algorithms for interval coloring, geometric packing and memory optimization
Extremal sets with forbidden configurations and the independence ratio of geometric hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Coloring Graphs in Oriented Coloring of Cubic Graphs
Traces of Hypergraphs
Quasi-random hypergraphs and extremal problems for hypergraphs
Coloring of signed graphs
Interaction on hypergraphs
Drawing layered hypergraphs
Coloring Intersection Hypergraphs of Pseudo-Disks
Strongly Proper Connected Coloring of Graphs
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz
Algorithms for interval coloring, geometric packing and memory optimization
Extremal sets with forbidden configurations and the independence ratio of geometric hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Coloring Graphs in Oriented Coloring of Cubic Graphs
Traces of Hypergraphs
Quasi-random hypergraphs and extremal problems for hypergraphs
Coloring of signed graphs
Interaction on hypergraphs
Drawing layered hypergraphs
Coloring Intersection Hypergraphs of Pseudo-Disks
Strongly Proper Connected Coloring of Graphs
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz
Algorithms for interval coloring, geometric packing and memory optimization
Extremal sets with forbidden configurations and the independence ratio of geometric hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Coloring Graphs in Oriented Coloring of Cubic Graphs
Traces of Hypergraphs
Quasi-random hypergraphs and extremal problems for hypergraphs
Coloring of signed graphs
Interaction on hypergraphs