[PDF] Top 20 Subcritical graph classes containing all planar graphs
Has 10000 "Subcritical graph classes containing all planar graphs" found on our website. Below are the top 20 most common "Subcritical graph classes containing all planar graphs".
Subcritical graph classes containing all planar graphs
... is planar, it remains so after the edge ...cases, all newly created blocks (which are subgraphs of the old block with the contracted edge) satisfy the condition of Definition 1, completing our ... See full document
10
Quartic planar graphs
... partite graphs as they rely on, for instance, the existence of edge-disjoint Hamilton circuits, or the fact that segments of consecutive vertices have a particular form (in the complete bipartite case) or are ... See full document
121
Communicability angle and the spatial efficiency of networks
... The richness of this approach goes beyond the results presented here; there are a few immediate directions of research in this area which can open new opportunities for the analysis of networks. The use of the ... See full document
21
Kernelization using structural parameters on sparse graph classes
... to graph classes which are not part of the sparse graph ...dense graph class would be especially ...for classes of bounded expansion and an almost linear kernel for nowhere dense ... See full document
44
Separators in High-Genus Near-Planar Graphs
... The planar separator theorem as presented by Lipton and Tarjan [1] is often used as a basis for separator theorems for more complicated classes, and an understanding of it is useful for separator results in ... See full document
51
A characterization of graph properties testable for general planar graphs with one sided error (it's all about forbidden subgraphs)
... big graphs is one of the most funda- mental problems in network analysis, extensively studied in the ...different classes of networks have the same frequent subgraphs and they differ for different network ... See full document
25
Wheel Planar Graphs in Topology
... Consider the n+1 case, we can choose an edge e={u, v} such that G/e with the identified vertex v is still 3-connected. This means that G-v is 2-connected. Now consider the cycle C containing all the ... See full document
5
Some Properties of the Line Graphs Associated to the Total Graph of a Commutative Ring
... determine some properties of this graph. The results related to the embedding problem are given in the paper [7]. There is the list of all isomorphism classes of finite commutative rings for which ... See full document
5
On the Planarity of Generalized Line Graphs
... A graph G is called a line graph if there exists a graph H such that G = L ( H ...line graphs is probably a forbidden subgraph characterization due to Beineke ...a graph G is a cycle ... See full document
11
Ultraviolet finite noncommutative theories
... to graphs containing gauge fields, and to other ...any planar graph, the loop momenta from the corresponding Feynman graph may be assigned to closed loops of the planar ... See full document
12
On the extremal hyper wiener index of graphs
... of graph, and present the graphs which minimize the Hyper-Wiener index among all graphs with given chromatic number and clique number and the graphs which maximum the Hyper-Wiener index ... See full document
5
Perfect $2$-colorings of the Platonic graphs
... The existence of completely regular codes in graphs is a historical problem in mathematics. Completely regular codes are a generalization of perfect codes. In 1973, Delsarte conjectured the non- existence of ... See full document
7
A Study on Face Integer Edge Cordial Graphs M. Mohamed Sheriff 1and A. Farhana Abbas 2
... (p,q) planar graph G means a graph G = (V,E), where V is the set of vertices with |V| = p, E is the set of edges with |E| = q and F is the set of interior faces of G with |F| = number of interior ... See full document
8
New results on word-representable graphs
... [7] A. Brandstädt, V.B. Le, J. Spinrad, Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA, 1999. xii+304 pp. ISBN: 0-89871-432-X. [8] M. Halldórsson, ... See full document
8
Device characterization of 0 21μm CMOS device
... The device was placed on the wafer plate which had vacuum tube to suck the wafer down to its place. The plate was placed right under the microscope to view the cross section of the device. Then the probes touch the four ... See full document
16
Rainbow Connection in Brick Product of Odd Cycle Graphs
... The brick product of even cycles was introduced in a paper by Alspach et al. in [9] and it was proved that these graphs exhibit hamiltonian laceability properties. Using this concept Shenoy and Murali in [10] ... See full document
10
Computing Szeged index of graphs on triples
... Let denote the automorphism group of the graph G. Then acts as a permutation group on the vertex set V of G. If e uv is an edge of G and , then by defining e u v , we observe that acts on the ... See full document
6
Upper and lower bounds of symmetric division deg index
... extremal graphs obtained with the help of MathChem [10] have particularly simple and elegant ...extremal graphs of the SDD index in several classes of graphs (with given number of vertices): ... See full document
8
On the classification problem for split graphs
... split graph is a graph whose vertex set admits a par- tition into a clique and a stable ...Split graphs are a well-studied class of graphs for which most combinato- rial problems are solved ... See full document
7
Geometric Number of Planar Graphs
... Suppose planar graph G is a SD graph. So Graph G* is a simple ...dual graph if the graph has two boundary edges common between their ... See full document
7
Related subjects