On the Maximum Average Degree and the Oriented Chromatic Number of a Graph

On the Maximum Average Degree and the Oriented Chromatic Number of a Graph (1995)

Cached

Download Links

[www.labri.fr]
[www.labri.u-bordeaux.fr]

Other Repositories/Bibliography

DBLP

by O. V. Borodin , A. V. Kostochka , J. Nesetril , A. Raspaud , E. Sopena

Venue:	Discrete Math
Citations:	27 - 13 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On the Maximum Average Degree and the Oriented Chromatic Number of a Graph	user correction - Legacy Corrections
AUTHOR NAME	O. V. Borodin	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Math	SVM HeaderParse 0.2
AUTHOR ADDR	, University of Nottingham, Nottingham, NG7 2RD, UK	SVM HeaderParse 0.1
AUTHOR NAME	A. V. Kostochka	SVM HeaderParse 0.1
AUTHOR AFFIL	y; Institute of Mathematics	SVM HeaderParse 0.2
AUTHOR ADDR	630090, Novosibirsk, Russia	SVM HeaderParse 0.1
AUTHOR NAME	J. Nesetril	SVM HeaderParse 0.1
AUTHOR AFFIL	z; Dept. of Appl. Math., Charles University, Prague	SVM HeaderParse 0.2
AUTHOR ADDR	Czech Republic	SVM HeaderParse 0.1
AUTHOR NAME	A. Raspaud	SVM HeaderParse 0.1
AUTHOR ADDR	LaBRI, Universit'e Bordeaux I, 33405 Talence, France	SVM HeaderParse 0.1
AUTHOR NAME	E. Sopena	SVM HeaderParse 0.1
AUTHOR ADDR	LaBRI, Universit'e Bordeaux I, 33405 Talence, France	SVM HeaderParse 0.1
ABSTRACT	The oriented chromatic number o(H) of an oriented graph H is defined as the minimum order of an oriented graph H 0 such that H has a homomorphism to H 0 . The oriented chromatic number o(G) of an undirected graph G is then defined as the maximum oriented chromatic number of its orientations. In this paper we study the links between o(G) and mad(G) defined as the maximum average degree of the subgraphs of G. 1 Introduction and statement of results For every graph G we denote by V (G), with vG = jV (G)j, its set of vertices and by E(G), with e G = jE(G)j, its set of arcs or edges. A homomorphism from a graph G to a graph On leave of absence from the Institute of Mathematics, Novosibirsk, 630090, Russia. With support from Engineering and Physical Sciences Research Council, UK, grant GR/K00561, and from the International Science Foundation, grant NQ4000. y This work was partially supported by the Network DIMANET of the European Union and by the grant 96-01-01614 of the Russian F...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	Discrete Math	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	206	INFERENCE
VOLUME	206	INFERENCE
TECH	Preprint	INFERENCE
CITATIONS	18 found	ParsCit 1.0