Trees with depression three

被引：4

作者：

Mynhardt, C. M. ^{[1
]}

机构：

[1] Univ Victoria, Dept Math & Stat, Victoria, BC V8W 3P4, Canada

来源：

DISCRETE MATHEMATICS | 2008年 / 308卷 / 5-6期

基金：

加拿大自然科学与工程研究理事会;

关键词：

edge ordering; increasing path; monotone path; depression;

D O I：

10.1016/j.disc.2007.07.039

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An edge ordering of a graph G = (V, E) is an injection f : E --> N. A (simple) path for which f increases along its edge sequence is an f-ascent, and a maximal f-ascent if it is not contained in a longer f-ascent. The depression of G is the least integer k such that every edge ordering of G has a maximal ascent of length at most k. We characterise trees with depression three. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：855 / 864

页数：10

共 50 条

[1] 'Three trees'
Henry, P
[J]. POETRY REVIEW, 2004, 94 (03): : 44 - 44
[2] Three trees
Wildermuth, Hans
[J]. ALLGEMEINE ZEITSCHRIFT FUR PSYCHIATRIE UND PSYCHISCH-GERICHTLICHE MEDIZIN, 1934, 102 (4-8): : 356 - 361
[3] A lower hound for the depression of trees
Cockayne, E. J.
Mynhardt, C. M.
[J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 35 : 319 - 328
[4] Three liberty trees
Marks, Susan
[J]. LONDON REVIEW OF INTERNATIONAL LAW, 2019, 7 (03) : 295 - 319
[5] Packing three trees
Wozniak, M
[J]. DISCRETE MATHEMATICS, 1996, 150 (1-3) : 393 - 402
[6] The House of Three Trees
Kim, Jae K.
[J]. SPACE, 2019, (620): : 70 - 77
[7] Packing three trees
[J]. Discrete Math, 1-3 (393):
[8] Three Trees of India
Khurd, Tulsi
Kalan, Banwari
[J]. METROPOLITAN MUSEUM OF ART BULLETIN, 2014, 72 (02): : 32 - 32
[9] The three trees of Hudimesnil
Toussaint, Jean-Philippe
[J]. NOUVELLE REVUE FRANCAISE, 2020, (640): : 105 - 109
[10] SIMONDS,CHARLES THE 'THREE TREES'
不详
[J]. A + U-ARCHITECTURE AND URBANISM, 1996, (308): : 53 - 53

← 1 2 3 4 5 →