保持圖的完全可定向性 preserving fully orientability o.pptVIP

Full Oreintability of Graphs Li-Da Tong Department of Applied Mathematics National Sun Yat-sen University November 12, 2009 Outline Dependent arcs ↙ ↘ Cover graphs Fully orientable Dependent arc Let D be an acyclic orientation of G. An arc of D is called dependent if its reversal creates a directed cycle. Dependent arc Let D be an acyclic orientation of G. An arc of D is called dependent if its reversal creates a directed cycle. Cover graph A cover graph is the underlying graph of the Hasse diagram of a finite partially ordered set. V=the power set of {1,2,3} and (V,?) is a partially ordered set. We have that ? {1} {2} {3} {1,2} {1,3} {2,3} {1,2,3} (Pretzel, 1985) A graph G is a cover graph if and only if there exists an acyclic orientation of G without dependent arc. ? {3} {1,2} {1,3} {1,2,3} (Brightwell, 1993) The recognition problem of cover graphs is NP-complete. (Ne?et?il, R?dl, 1978) There are non-cover graphs with arbitrarily large girth. Concrete examples of non-cover graphs have been constructed for only graphs having girth at most 6. d(D), dmin(G), dmax(G) d(D) : the number of dependent arcs of an acyclic orientation D. dmin(G) : the minimum number of depen- dent arcs over all acyclic orientations of G. dmax(G) : the maximum number of depen- dent arcs over all acyclic orientations of G. dmax(G) Theorem If G is a graph with k components, then dmax(G) = ||G||－ |G| ＋ k. Upper bound for dmin Theorem (Fisher et al.) If G is a graph with chromatic number ? ? 2, then dmin(G) ? ||G||(? ?