[PDF] Top 20 Rank numbers for graphs with paths and cycles
Has 10000 "Rank numbers for graphs with paths and cycles" found on our website. Below are the top 20 most common "Rank numbers for graphs with paths and cycles".
Rank numbers for graphs with paths and cycles
... This Thesis is brought to you for free and open access by the Thesis/Dissertation Collections at RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administ[r] ... See full document
32
Paths, Cycles and Wheels in Graphs without Antitriangles
... We investigate paths, cycles and wheels in graphs with independence number of at most 2, in particular we prove theorems characterizing ali such graphs which are [r] ... See full document
12
Partitioning edge coloured complete graphs into monochromatic cycles and paths
... bipartite graphs which cannot be partitioned into 2r − 2 monochromatic ...monochromatic cycles, which is the best known upper bound to how many paths are needed in Conjecture ... See full document
26
Thesis: Paths and Cycles in Graphs. Adviser: Professor K. Ota.
... 1. Algorithmic Graph Minor Theory; Decomposition, Approximation and Coloring, (with E. D. Demaine, M. Hajiaghayi), 46th Annual Symposium on Foundations of Computer Science (FOCS 2005) (2005) 637–646. 2. Approximating the ... See full document
22
On-line Ramsey Numbers of Paths and Cycles
... (iii) R contains no isolated vertices. Proposition 13. Let G and H be graphs. Let F be a family of graphs with G ∈ F . Suppose every F -scaffolding for H has at least m edges. Then ˜ r(G, H) > m + e(H). ... See full document
32
ON THE SPECTRA OF CYCLES AND PATHS
... hand side of this equation is called the characteristic (or spectral) polynomial of A (and of the graph G). The set of all eigenvalues of the adjacency matrix A is called the spectrum of the graph G, denoted by S(G). For ... See full document
10
Domination game on paths and cycles
... In this paper we will study the domination game on paths and cycles. Kinnersley et al. have in [13] already found formulas for the game domination number of these graphs. Since these results are ... See full document
12
Paths and compatible hamiltonian cycles
... This problem belongs to a conjecture that has been present for a while, which says that given a set of points in the plane, there is always a spanning tree compatible with a Hamiltonian cycle. Very recently, the more ... See full document
116
Approximating Longest Directed Paths and Cycles
... Related work. Among the canonical NP-hard problems, the undirected version of this problem has been identified as the one that is least understood [4]. However, a number of recent papers have established increasingly good ... See full document
14
Matchings, factors and cycles in graphs
... The following Corollary will enable us to rule out Case 2 of Figure 2.2. Recall that R 6= ∅, by the remarks preceding (2.35). Corollary 2.22. A ∪ B = ∅; hence ǫ = 0. Proof. Suppose A ∪ B 6= ∅. Then Lemmas 2.19 and 2.21 ... See full document
141
Paths and trails in edge-colored graphs
... edge-colored cycles, such that a truth assignment for B corresponds to k properly edge-colored vertex disjoint s − t paths in G c , and reciprocally, k properly edge-colored vertex-disjoint s − t ... See full document
14
Approximate shortest paths in weighted graphs
... We assume that the input graph contains no negative cycles. In other words, for pairs u , v for which δ( u , v ) = −∞ , the result returned by the algorithm is meaningless. Clearly, any -additive approximation ... See full document
6
Finding k Simple Shortest Paths and Cycles
... shortest paths need not have the same ...shortest paths (SiSP) and cycles (SiSC) in a weighted directed graph under the following set-ups: the k simple shortest paths for all pairs of vertices ... See full document
12
Powers of Hamilton cycles in pseudorandom graphs
... Hence we resort to demanding (ε, p, k −1, 2k−1)-pseudorandomness. This allows us to show an inductive version of (⋆): at each step we maintain the property that most copies of K k in the final k sets are ends of ... See full document
32
Extremal problems for cycles in graphs and hypergraphs
... of paths, isolated vertices, and ...disjoint paths from S 0 to S 0 that cover all isolated vertices and paths in G[D] and all are disjoint from ...of cycles in G[D] is less than d − 2, then we ... See full document
144
The crossing numbers of several graphs of order eight with paths
... two graphs are one of few graph classes for which the cros- sing numbers were ...of graphs G 1 = (V 1 , E 1 ) and G 2 = (V 2 , E 2 ) is a graph with vertex set V = V 1 × V 2 and two vertices (v 1 , v ... See full document
7
Rainbow numbers for small cycles
... An edge-colored graph is called rainbow if all of its edges have distinct colors. For two graphs G and H, the anti-Ramsey number ar(G, H), introduced by Erd˝os et al. [3], is the maximum number of colors in an ... See full document
7
Rectangle Visibility Numbers of Graphs
... zigzag paths from A i as a bar visibility graph where the bars overlap in a "staircase" such that each bar has an unobstructed channel of visibility in both vertical and horizontal ... See full document
41
Rectangle Visibility Numbers of Graphs
... zigzag paths from A i as a bar visibility graph where the bars overlap in a "staircase" such that each bar has an unobstructed channel of visibility in both vertical and horizontal ... See full document
41
Rank numbers of grid graphs
... To complete the determination of rank numbers of grid graphs would require finding a good lower bound for rank numbers of square grids. There are also other natural extensions of the ... See full document
10
Related subjects