论文信息 - On triangle path convexity in graphs - 字舞流文

On triangle path convexity in graphs

Abstract Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity.

Manoj Changat | Joseph Mathews | M. Changat | Joseph Mathews

[1] Ladislav Nebesky,et al. A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph , 2001 .

[2] Hans-Jürgen Bandelt,et al. Graphs with intrinsic s3 convexities , 1989, J. Graph Theory.

[3] J. Calder. Some Elementary Properties of Interval Convexities , 1971 .

[4] Pierre Duchet,et al. Convex sets in graphs, II. Minimal path convexity , 1987, J. Comb. Theory B.

[5] Gary Chartrand,et al. Convex sets in graphs , 1999 .

[6] Robert E. Tarjan,et al. Decomposition by clique separators , 1985, Discret. Math..

[7] Robert E. Jamison-Waldner. PARTITION NUMBERS FOR TREES AND ORDERED SETS , 1981 .

[8] Pierre Duchet. Convexity in combinatorial structures , 1987 .

[9] F. W. Levi,et al. On Helly's Theorem and the Axioms of Convexity , 1951 .

[10] P. Duchet,et al. Discrete convexity : retractions , morphisms and the partition problem , 1998 .

[11] Van de M. L. J. Vel. Theory of convex structures , 1993 .

[12] G. Sierksma. CARATHEODORY AND HELLY-NUMBERS OF CONVEX-PRODUCT-STRUCTURES , 1975 .

[13] Sandi Klavzar,et al. The All-Paths Transit Function of a Graph , 2001 .

[14] H. M. Mulder. The interval function of a graph , 1980 .