Maximum number of colors in hypertrees of bounded degree
Year of publication: |
December 2015
|
---|---|
Authors: | Bujtás, Csilla ; Tuza, Zsolt |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 23.2015, 4, p. 867-876
|
Subject: | Hypergraph | Hypertree | Arboreal hypergraph | Vertex coloring | C-coloring | Upper chromatic number | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Operations Research | Operations research | USA | United States |
-
Uniform multicommodity flow through the complete graph with random edge-capacities
Aldous, David J., (2009)
-
Inderfurth, Karl, (2000)
-
An improved multiobjective shortest path algorithm
Maristany de las Casas, Pedro, (2021)
- More ...
-
Tuza, Zsolt, (1989)
-
Satisfactory graph partition, variants, and generalizations
Bazgan, Cristina, (2010)
-
Colorability of mixed hypergraphs and their chromatic inversions
Hegyháti, Máté, (2013)
- More ...