Connected graphs without long paths
نویسندگان
چکیده
منابع مشابه
Connected graphs without long paths
A problem, first considered by Erdős and Gallai [2], was to determine the maximum number of edges in any graph on n vertices if it contains no path with k + 1 vertices. This maximum number, ext(n, Pk+1), is called the extremal number for the path Pk+1. Erdős and Gallai proved the following theorem, which was one of the earliest extremal results in graph theory. Theorem 1.1 ([2]). For every k ≥ ...
متن کاملConnected dominating set in graphs without long paths and cycles
The ratio of the connected domination number, γc, and the domination number, γ, is strictly bounded from above by 3. It was shown by Zverovich that for every connected (P5, C5)-free graph, γc = γ. In this paper, we investigate the interdependence of γ and γc in the class of (Pk, Ck)-free graphs, for k ≥ 6. We prove that for every connected (P6, C6)-free graph, γc ≤ γ+1 holds, and there is a fam...
متن کاملApproximately Coloring Graphs Without Long Induced Paths
It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable graph without an induced path on t vertices, computes a coloring with max { 5, 2 ⌈ t−1 2 ⌉ − 2 } many colors. If the input graph is triangle-free, we only need max { 4, ⌈ t−1...
متن کاملAlgorithm for two disjoint long paths in 2-connected graphs
Denote by σ̄k = min {d(x1)+d(x2)+ · · ·+d(xk)−|N(x1)∩N(x2)∩· · ·∩N(xk)| | x1, x2, · · · , xk are k independent vertices in G}. Let n and m denote the number of vertices and edges of G. For any connected graph G, we give a polynomial algorithm in O(nm) time to either find two disjoint paths P1 and P2 such that |P1|+ |P2| ≥ min{σ̄4, n} or output G = ∪i=1Gi such that for any i, j ∈ {1, 2, ..., k} (k...
متن کاملEla Maxima of the Q-index: Graphs without Long Paths
This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of graphs with no paths of given order. Thus, let Sn,k be the join of a complete graph of order k and an independent set of order n− k, and let S n,k be the graph obtained by adding an edge to Sn,k. The main result of the paper is the following theorem: Let k ≥ 1, n ≥ 7k, and let G be a graph of order n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.08.047