Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time

Published 18 Feb 2019 in math.CO and cs.DM | (1902.06484v2)

Abstract: We apply the Euler tour technique to find subtrees of specified weight as follows. Let k,g,N1,N2∈Nk, g, N_1, N_2 \in \mathbb{N} such that 1≤k≤N21 \leq k \leq N_2, g+h>2g + h > 2 and 2k−4g−h+3≤N2≤2k+g+h−22k - 4g - h + 3 \leq N_2 \leq 2k + g + h - 2, where h:=2N1−N2h := 2N_1 - N_2. Let TT be a tree of N1N_1 vertices and let c:V(T)→Nc : V(T) \rightarrow \mathbb{N} be vertex weights such that c(T):=∑v∈V(T)c(v)=N2c(T) := \sum_{v \in V(T)} c(v) = N_2 and c(v)≤kc(v) \leq k for all v∈V(T)v \in V(T). We prove that a subtree SS of TT of weight k−g+1≤c(S)≤kk - g + 1 \leq c(S) \leq k exists and can be found in linear time. We apply it to show, among others, the following: (i) Every planar hamiltonian graph G=(V(G),E(G))G = (V(G), E(G)) with minimum degree δ≥4\delta \geq 4 has a cycle of length kk for every k∈{⌊∣V(G)∣2⌋,…,⌈∣V(G)∣2⌉+3}k \in \{\lfloor \frac{|V(G)|}{2} \rfloor, \dots, \lceil \frac{|V(G)|}{2} \rceil + 3\} with 3≤k≤∣V(G)∣3 \leq k \leq |V(G)|. (ii) Every $3$-connected planar hamiltonian graph GG with δ≥4\delta \geq 4 and ∣V(G)∣≥8|V(G)| \geq 8 even has a cycle of length ∣V(G)∣2−1\frac{|V(G)|}{2} - 1 or ∣V(G)∣2−2\frac{|V(G)|}{2} - 2. Each of these cycles can be found in linear time if a Hamilton cycle of the graph is given. This work was partially motivated by conjectures of Bondy and Malkevitch on cycle spectra of 4-connected planar graphs.

Authors (1)
Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.