A note on sparseness conditions on chordless vertices of cycles
نویسندگان
چکیده
منابع مشابه
Chordless Paths Through Three Vertices
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V,E), a positive integer k, and three distinct vertices s, t, and v ∈ V , is there a chordless path from s via v to t in G that consists of at most k vertices? In a chordless path, no two vertices are connected by an edge that is not in the path. Alternat...
متن کاملDistributing vertices on Hamiltonian cycles
Let G be a graph of order n and 3 ≤ t ≤ n4 be an integer. Recently, Kaneko and Yoshimoto provided a sharp δ(G) condition such that for any set X of t vertices, G contains a hamiltonian cycle H so that the distance along H between any two vertices of X is at least n/2t. In this paper, minimum degree and connectivity conditions are determined such that for any graph G of sufficiently large order ...
متن کاملPolynomial enumeration of chordless cycles on cyclically orientable graphs
In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an algorithm to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithm have the advantage of finding each chordle...
متن کاملOn cycles through specified vertices
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
متن کاملEfficient Enumeration of Chordless Cycles
In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms have the advantage of finding each chordless cycle only once. To ensure this, we introduced the concepts of vertex labeling and initial valid vertex triplet. To g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.04.017