نتایج جستجو برای: subdivision graph

تعداد نتایج: 202953  

Journal: :Journal of Graph Theory 2017
Nicolas Trotignon Kristina Vuskovic

We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least 5 in this class is 3-colorable. AMS Classification: 05C75

2017
Muhammad Ajmal Waqas Nazeer Shin Min Kang

A chemical graph can be recognized by a numerical number (topological index), algebraic polynomial or any matrix. These numbers and polynomials help to predict many physico-chemical properties of underline chemical compound. In this paper, 1Corresponding author. we compute first and second Zagreb polynomials and multiple Zagreb indices of the Line graphs of Banana tree graph, Firecracker graph ...

Journal: :Journal of Graph Theory 2004
Thomas Böhme Bojan Mohar Riste Skrekovski Michael Stiebitz

It is proved that for every positive integers k, r and s there exists an integer n = n(k, r, s) such that every k-connected graph of order at least n contains either an induced path of length s or a subdivision of the complete bipartite graph Kk,r.

Journal: :Computers & Graphics 2002
Luiz Velho Ken Perlin Henning Biermann Lexing Ying

We present methods for synthesizing 3D shape features on subdivision surfaces using multi-scale procedural techniques. Multi-scale synthesis is a powerful approach for creating surfaces with different levels of detail. Our methods can also blend multiple example multi-resolution surfaces, including procedurally defined surfaces as well as captured models. r 2002 Elsevier Science Ltd. All rights...

Journal: :Comput. Graph. Forum 2012
Lei He Charles T. Loop Scott Schaefer

We provide a method for improving the parameterization of patching schemes that approximate Catmull-Clark subdivision surfaces, such that the new parameterization conforms better to that of the original subdivision surface. We create this reparameterization in real-time using a method that only depends on the topology of the surface and is independent of the surface’s geometry. Our method can h...

2010
Veronika Kraus

An outerplanar graph is a planar graph which can be embedded in the plane such that all nodes lie on the outer face. A series-parallel graph is a graph which is the result of series (subdivision) or parallel (doubling) extensions of the edges of a forest. (Both graph families can be described via families of forbidden minors {K4,K23} and {K4}, respectively, where K4 denotes the complete graph o...

Journal: :Discrete Mathematics 2015
Tillmann Miltzow Jens M. Schmidt Mingji Xia

A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of K4. As a generalization, we ask for the minimum number of K4-subdivisions that are contained in every 3connected graph on n vertices. We prove that there are Ω(n) such K4subdivisions and show that the order of this bound is tight for infinitely many graphs. We further prove that the computational c...

Journal: :Journal of Graph Theory 1994
Noga Alon

It is shown that the Ramsey number of any graph with n vertices in which no two vertices of degree at least 3 are adjacent is at most 12n. In particular, the above estimate holds for the Ramsey number of any n-vertex subdivision of an arbitrary graph, provided each edge of the original graph is subdivided at least once. This settles a problem of Burr and Erdös.

Journal: :Comput. Graph. Forum 2002
Faramarz F. Samavati Nezam Mahdavi-Amiri Richard H. Bartels

We have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models 16. As a result, semiorthogonal wavelet systems have also been generated. To construct a multiresolution surface of an arbitrary topology, however, biorthogonal wavelets are needed. In 1 we introduced local least squares models for reversing subdivision rules to construct ...

Journal: :Graphical Models 2007
Carsten Moenning Facundo Mémoli Guillermo Sapiro Nira Dyn Neil A. Dodgson

Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with point cloud data directly, any processing is based on the given raw data and its underlying geometry rather than any arbitrary intermediate representations and generally artificial connectivity relations. In this paper, ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید