Hypergraph Coloring by Bichromatic Exchanges

Dominique Werra

Chapter Chapter 9 in Graph Theory and Combinatorial Optimization, 2005, pp 255-264 from Springer

Abstract: Abstract A general forniulation of hypergraph colorings is given as an introduction. In addition, this note presents an extension of a known coloring property of unimodular hypergraphs; in particular it implies that a unimodular hypergraph with maximum degree d has ari equitable k-coloring (S1,…,S k ) with 1 + (d − 1)|S k |≧|S1|≧…≧|S k |. Moreover this also holds with the same d for some transformations of H (although the rnaximum degree may be increased). An adaptation to balanced hypergraphs is given.

Keywords: Maximum Degree; Color Classis; Edge Coloring; Perfect Graph; Zero Entry (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-25592-7_9

Ordering information: This item can be ordered from
http://www.springer.com/9780387255927

DOI: 10.1007/0-387-25592-3_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().