共查询到20条相似文献,搜索用时 46 毫秒
1.
The Depth First Search (DFS) algorithm is one of the basic techniques that is used in a very large variety of graph algorithms. Most applications of the DFS involve the construction of a depth-first spanning tree (DFS tree). In this paper, we give a complete characterization of all the graphs in which every spanning tree is a DFS tree. These graphs are called Total-DFS-Graphs. We prove that Total-DFS-Graphs are closed under minors. It follows by the work of Robertson and Seymour on graph minors that there is a finite set of forbidden minors of these graphs and that there is a polynomial algorithm for their recognition. We also provide explicit characterizations of these graphs in terms of forbidden minors and forbidden topological minors. The complete characterization implies explicit linear algorithm for their recognition. In some problems the degree of some vertices in the DFS tree obtained in a certain run are crucial and therefore we also consider the following problem: Let G = (V,E) be a connected undirected graph where |V| = n and let d ? Nn be a degree sequence upper bound vector. Is there any DFS tree T with degree sequence d T that violates d (i.e., d T ≤ d , which means: E j such that d T(j) > d (j))? We show that this problem is NP-complete even for the case where we restrict the degree of only on specific vertex to be less than or equal to k for a fixed k ≥ 2 (i.e., d = (n - 1, ?, n - 1, k, n - 1, ?, n - 1)). 0 1995 John Wiley & Sons, Inc. 相似文献
2.
We investigate vertex‐transitive graphs that admit planar embeddings having infinite faces, i.e., faces whose boundary is a double ray. In the case of graphs with connectivity exactly 2, we present examples wherein no face is finite. In particular, the planar embeddings of the Cartesian product of the r‐valent tree with K2 are comprehensively studied and enumerated, as are the automorphisms of the resulting maps, and it is shown for r = 3 that no vertex‐transitive group of graph automorphisms is extendable to a group of homeomorphisms of the plane. We present all known families of infinite, locally finite, vertex‐transitive graphs of connectivity 3 and an infinite family of 4‐connected graphs that admit planar embeddings wherein each vertex is incident with an infinite face. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 257–275, 2003 相似文献
3.
《纯数学与应用数学通讯》2018,71(9):1717-1849
We establish quantitative homogenization, large‐scale regularity, and Liouville results for the random conductance model on a supercritical (Bernoulli bond) percolation cluster. The results are also new in the case that the conductivity is constant on the cluster. The argument passes through a series of renormalization steps: first, we use standard percolation results to find a large scale above which the geometry of the percolation cluster behaves (in a sense, made precise) like that of euclidean space. Then, following the work of Barlow [8], we find a succession of larger scales on which certain functional and elliptic estimates hold. This gives us the analytic tools to adapt the quantitative homogenization program of Armstrong and Smart [7] to estimate the yet larger scale on which solutions on the cluster can be well‐approximated by harmonic functions on ℝd. This is the first quantitative homogenization result in a porous medium, and the harmonic approximation allows us to estimate the scale on which a higher‐order regularity theory holds. The size of each of these random scales is shown to have at least a stretched exponential moment. As a consequence of this regularity theory, we obtain a Liouville‐type result that states that, for each k ∊ ℕ, the vector space of solutions growing at most like o(|x|k+1) as |x| → ∞ has the same dimension as the set of harmonic polynomials of degree at most k, generalizing a result of Benjamini, Duminil‐Copin, Kozma, and Yadin from k ≤ 1 to k ∊ ℕ. © 2018 Wiley Periodicals, Inc. 相似文献
4.
Xin Ke 《Random Structures and Algorithms》1993,4(1):85-97
The size Ramsey number r?(G, H) of graphs G and H is the smallest integer r? such that there is a graph F with r? edges and if the edge set of F is red-blue colored, there exists either a red copy of G or a blue copy of H in F. This article shows that r?(Tnd, Tnd) ? c · d2 · n and c · n3 ? r?(Kn, Tnd) ? c(d)·n3 log n for every tree Tnd on n vertices. and maximal degree at most d and a complete graph Kn on n vertices. A generalization will be given. Probabilistic method is used throught this paper. © 1993 John Wiley Sons, Inc. 相似文献
5.
《Journal of Graph Theory》2018,89(3):350-360
Suzuki [Discrete Math. 310 (2010), 6–11] proved that for any orientable closed surface F2 other than the sphere, there exists an optimal 1‐planar graph which can be embedded on F2 as a triangulation. However, for nonorientable closed surfaces, the existence of such graphs is unknown. In this article, we prove that no optimal 1‐planar graph triangulates a nonorientable closed surface. 相似文献
6.
We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider ?fragmentable”? classes of graphs (an example is the class of planar graphs) that are, roughly speaking, graphs that can be decomposed into bounded-sized components by removing a small proportion of the vertices. We show that for such graphs of bounded degree the harmonious chromatic number is close to the lower bound (2m)1/2, where m is the number of edges. 相似文献
7.
The conjecture on acyclic 5‐choosability of planar graphs [Borodin et al., 2002] as yet has been verified only for several restricted classes of graphs. None of these classes allows 4‐cycles. We prove that a planar graph is acyclically 5‐choosable if it does not contain an i‐cycle adjacent to a j‐cycle where 3?j?5 if i = 3 and 4?j?6 if i = 4. This result absorbs most of the previous work in this direction. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:169‐176, 2011 相似文献
8.
Therese Biedl 《Discrete and Computational Geometry》2011,45(1):141-160
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, Θ(n
2) is the established upper and lower bound on the worst-case area. A long-standing open problem is to determine for what graphs
a smaller area can be achieved. We show here that series-parallel graphs can be drawn in O(n
3/2) area, and outerplanar graphs can be drawn in O(nlog n) area, but 2-outerplanar graphs and planar graphs of proper pathwidth 3 require Ω(n
2) area. Our drawings are visibility representations, which can be converted to polyline drawings of asymptotically the same
area. 相似文献
9.
10.
Archontia C. Giannopoulou Marcin Kamiński Dimitrios M. Thilikos 《Journal of Graph Theory》2015,78(1):43-60
Immersion is a containment relation on graphs that is weaker than topological minor. (Every topological minor of a graph is also its immersion.) The graphs that do not contain any of the Kuratowski graphs (K5 and K3, 3) as topological minors are exactly planar graphs. We give a structural characterization of graphs that exclude the Kuratowski graphs as immersions. We prove that they can be constructed from planar graphs that are subcubic or of branch‐width at most 10 by repetitively applying i‐edge‐sums, for . We also use this result to give a structural characterization of graphs that exclude K3, 3 as an immersion. 相似文献
11.
David R. Wood 《Journal of Graph Theory》2006,53(2):167-172
A k‐tree is a chordal graph with no (k + 2)‐clique. An ?‐tree‐partition of a graph G is a vertex partition of G into ‘bags,’ such that contracting each bag to a single vertex gives an ?‐tree (after deleting loops and replacing parallel edges by a single edge). We prove that for all k ≥ ? ≥ 0, every k‐tree has an ?‐tree‐partition in which each bag induces a connected ‐tree. An analogous result is proved for oriented k‐trees. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 167–172, 2006 相似文献
12.
In this paper, the boundedness of all solutions for the following planar reversible system Ju ′ = ?H (u) + G (u) + h (t) (1) is discussed, where the function H (u) ∈ C2(?2, ?+) is positive for u ≠ 0 and positively (q, p)‐quasihomogeneous of quasi‐degree pq, G ∈ C5 is bounded, h ∈ C6 is 2π ‐periodic and J is the standard symplectic matrix. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
13.
Riste krekovski 《Journal of Graph Theory》2002,39(1):50-61
In this paper, we study the critical point‐arboricity graphs. We prove two lower bounds for the number of edges of k‐critical point‐arboricity graphs. A theorem of Kronk is extended by proving that the point‐arboricity of a graph G embedded on a surface S with Euler genus g = 2, 5, 6 or g ≥ 10 is at most with equality holding iff G contains either K2k?1 or K2k?4 + C5 as a subgraph. It is also proved that locally planar graphs have point‐arboricity ≤ 3 and that triangle‐free locally planar‐graphs have point‐arboricity ≤ 2. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 50–61, 2002 相似文献
14.
A graph G is a quasi‐line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. A theorem of Shannon's implies that if G is a line graph, then it can be properly colored using no more than 3/2 ω(G) colors, where ω(G) is the size of the largest clique in G. In this article, we extend this result to all quasi‐line graphs. We also show that this bound is tight. © 2006 Wiley Periodicals, Inc. J Graph Theory 相似文献
15.
A graph G is a quasi‐line graph if for every vertex v ∈ V(G), the set of neighbors of v in G can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. Hadwiger's conjecture states that if a graph G is not t‐colorable then it contains Kt + 1 as a minor. This conjecture has been proved for line graphs by Reed and Seymour. We extend their result to all quasi‐line graphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 17–33, 2008 相似文献
16.
Peter F. Stadler 《Journal of Graph Theory》2003,43(2):150-155
Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003 相似文献
17.
Sophie Dispa 《Mathematische Nachrichten》2003,260(1):21-33
The aim of this paper is to study the equivalence between quasi‐norms of Besov spaces on domains. We suppose that the domain Ω ? ?n is a bounded Lipschitz open subset in ?n. First, we define Besov spaces on Ω as the restrictions of the corresponding Besov spaces on ?n. Then, with the help of equivalent and intrinsic characterizations (the Peetre‐type characterization 3.10 and the characterization via local means 3.13) of these spaces, we get another equivalent and intrinsic quasi‐norm using, this time, generalized differences and moduli of smoothness. We extend the well‐known characterization of Besov spaces on ?n described in Theorem 2.4 to the case of Lipschitz domains. 相似文献
18.
For a positive integer n, we introduce the new graph class of n‐ordered graphs, which generalize partial n‐trees. Several characterizations are given for the finite n‐ordered graphs, including one via a combinatorial game. We introduce new countably infinite graphs R(n), which we name the infinite random n‐ordered graphs. The graphs R(n) play a crucial role in the theory of n‐ordered graphs, and are inspired by recent research on the web graph and the infinite random graph. We characterize R(n) as a limit of a random process, and via an adjacency property and a certain folding operation. We prove that the induced subgraphs of R(n) are exactly the countable n‐ordered graphs. We show that all countable groups embed in the automorphism group of R(n). © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 204–218, 2009 相似文献
19.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
20.
Quasi‐random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi‐randomness of graphs. Let k ≥ 2 be a fixed integer, α1,…,αk be positive reals satisfying \begin{align*}\sum_{i} \alpha_i = 1\end{align*} and (α1,…,αk)≠(1/k,…,1/k), and G be a graph on n vertices. If for every partition of the vertices of G into sets V 1,…,V k of size α1n,…,αkn, the number of complete graphs on k vertices which have exactly one vertex in each of these sets is similar to what we would expect in a random graph, then the graph is quasi‐random. However, the method of quasi‐random hypergraphs they used did not provide enough information to resolve the case (1/k,…,1/k) for graphs. In their work, Shapira and Yuster asked whether this case also forces the graph to be quasi‐random. Janson also posed the same question in his study of quasi‐randomness under the framework of graph limits. In this paper, we positively answer their question. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011 相似文献