Results 251 to 260 of about 125,344 (284)

Co-2-plex vertex partitions

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

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

Computational techniques for vertex partitioning of graphs

Journal of Chemical Information and Computer Sciences, 1990
A powerful vertex-partitioning algorithm is developed and applied for vertex partitioning of graphs of chemical and spectroscopic interest. The codes developed on the basis of these algorithms are tested and compared for performance with other methods based on the Morgan algorithm and the principal eigenvector algorithm based on the Givens-Householder ...
X Y, Liu, K, Balasubramanian, M E, Munk
openaire   +2 more sources

Transversals of Vertex Partitions in Graphs

SIAM Journal on Discrete Mathematics, 1990
This paper studies a number of graph-theoretic parameters that are defined by statements of the form: For every partition of the vertex set that satisfies an upper (or lower) bound on the number of elements in each partition class, there is a transveral of the partition that is an independent (or dominating) set.
openaire   +1 more source

Vertex Partitions of K4,4-Minor Free Graphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 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

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

A rooted-forest partition with uniform vertex demand

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

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   +2 more sources

Vertex partitions and maximum degenerate subgraphs

Journal of Graph Theory, 2007
AbstractLet G be a graph with maximum degree d≥ 3 and ω(G)≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In this work, we prove that G has a vertex partition S1, S2 such that G[S1] is a maximum order (p1‐1)‐degenerate subgraph of G and G[S2] is a (p2‐1)‐degenerate subgraph, where G[Si]
openaire   +1 more source