On vertex-degree restricted paths in polyhedral graphs
نویسندگان
چکیده
منابع مشابه
Restricted vertex multicut on permutation graphs
Given an undirected graph and pairs of terminals theRestricted Vertex Multicut problem asks for a minimum set of nonterminal vertices whose removal disconnects each pair of terminals. The problem is known to be NP-complete for trees and polynomial-time solvable for interval graphs. In this paper we give a polynomial-time algorithm for the problem on permutation graphs. Furthermore we show that ...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملColorful Paths in Vertex Coloring of Graphs
A colorful path in a graph G is a path with χ(G) vertices whose colors are different. A vcolorful path is such a path, starting from v. Let G 6= C7 be a connected graph with maximum degree ∆(G). We show that there exists a (∆(G) + 1)-coloring of G with a v-colorful path for every v ∈ V (G). We also prove that this result is true if one replaces (∆(G) + 1) colors with 2χ(G) colors. If χ(G) = ω(G...
متن کاملDegree Sum and Vertex Dominating Paths
A vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P . In 1988 H. Broersma stated a result implying that every n-vertex kconnected graph G such that σ(k+2)(G) ≥ n− 2k − 1 contains a dominating path. We show that every n-vertex k-connected graph with σ2(G) ≥ 2n k+2 + f(k) contains a dominating path of length at most O(|T |), where T is a minimum do...
متن کاملVertex Disjoint Paths in Upward Planar Graphs
The k-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed k when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter k) on this restricted class. Only recently, [1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00209-5