Results 261 to 270 of about 184,015 (290)

Co-2-plex vertex partitions

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin McClosky, John D. Arellano, Illya V. Hicks   +2 more
openaire   +2 more sources

Efficient graph automorphism by vertex partitioning

Artificial Intelligence, 1983
We describe a vertex partitioning method and squeeze tree search technique, which can be used to determine the automorphism partition of a graph in polynomial time for all graphs tested, including those which are strongly regular. The vertex partitioning procedure is based on first transforming the graph by the 1-or 2-subdivision transform or the 1-or ...
Fowler, G., Haralick, R., Gray, F. G., Feustel, C., Grinstead, Charles M.   +4 more
openaire   +2 more sources

A rooted-forest partition with uniform vertex demand

Journal of Combinatorial Optimization, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naoki Katoh, Shin-ichi Tanigawa
openaire   +1 more source

Partitions of the VertexSet and Vertex Separators

2012
exaly   +2 more sources

Partition conditions and vertex-connectivity of graphs

Combinatorica, 1981
It was proved ([5], [6]) that ifG is ann-vertex-connected graph then for any vertex sequencev 1, ...,v n ≠V(G) and for any sequence of positive integersk 1, ...,k n such thatk 1+...+k n =|V(G)|, there exists ann-partition ofV(G) such that this partition separates the verticesv 1, ...,v(n), and the class of the partition containingv i induces a ...
openaire   +3 more sources

Vertex partitioning problems on partial k-trees

1996
We describe a general approach to obtain polynomial-time algorithms over partial k-trees for graph problems in which the vertex set is to be partitioned in some way. We encode these problems with formulae of the Extended Monadic Second-order (or EMS) logic. Such a formula can be translated into a polynomial-time algorithm automatically. We focus on the
Gupta, A., Kaller, D., Mahajan, S., Shermer, T.   +3 more
openaire   +2 more sources

Vertex partitions of r-edge-colored graphs

Applied Mathematics-A Journal of Chinese Universities, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin, Zemin, Li, Xueliang
openaire   +2 more sources

Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing

IEEE Transactions on Systems, Man, and Cybernetics, 1980
In this paper we have pursued the initial vertex partioning methodology for a graph (digraph) isomorphism testing problem using lexicographic ordering of vertex codes. The newly introduced vertex codes (which may be of fixed length or of variable length) incorporate order independent parameters of a graph in relation to a vertex and can be computed ...
openaire   +3 more sources

Partition Function of the Eight-Vertex Lattice Model

Annals of Physics, 1972
The partition function of the zero-field “Eight-Vertex” model on a square M by N lattice is calculated exactly in the limit of M, N large. This model includes the dimer, ice and zero-field Ising, F and KDP models as special cases. In general the free energy has a branch point singularity at a phase transition, with an irrational exponent.
openaire   +2 more sources

Vertex Partitions of K4,4-Minor Free Graphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources