15 search results - page 1 / 3 » On the chromatic number of an oriented matroid |
CPC
2006
13 years 6 months ago
2006
JCT
2008
13 years 6 months ago
2008
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
EJC
2006
13 years 6 months ago
2006
We present a seemingly new definition of flows and flow numbers for oriented matroids and prove that the flow number L and the antisymmetric flow number Las of an oriented matroid...
IWOCA
2009
Springer
14 years 18 days ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...