Results 221 to 230 of about 1,814,953 (245)

The Parallel Recognition of Classes of Graphs

IEEE Transactions on Computers, 1980
Parallel cellular algorithms for recognizing adjacency and incidence matrices of several classes of graphs are given. These classes include cubic graphs, complete graphs, connected graphs, and trees.
openaire   +1 more source

Class‐reconstruction of total graphs

Journal of Graph Theory, 1987
AbstractIt is shown that given any vertex‐deleted total graph, every reconstruction into a total graph by the addition of a vertex yields the original total graph. The proof indicates how the reconstruction can be done.
David W. Bange, Anthony E. Barkauskas, Linda H. Host   +2 more
openaire   +3 more sources

Boundary Classes of Planar Graphs

Combinatorics, Probability and Computing, 2008
We analyse classes of planar graphs with respect to various properties such as polynomial-time solvability of thedominating setproblem or boundedness of the tree-width. A helpful tool to address this question is the notion of boundary classes. The main result of the paper is that for many important properties there are exactly two boundary classes of ...
openaire   +3 more sources

Classes of Graphs that Are Not Vertex Ramsey

SIAM Journal on Discrete Mathematics, 1997
Summary: \textit{N. Sauer} [Combinatorics, Paul Erdős is eighty. Vol. 1, 361-377 (1993; Zbl 0795.05104)] has conjectured that for any tree \(T\) and any clique \(K\), the class \(\text{Forb} (T, K)\) of graphs that induces neither \(T\) nor \(K\) is not vertex Ramsey.
openaire   +3 more sources

The Normal Graph Conjecture for Classes of Sparse Graphs

2013
Normal graphs are defined in terms of cross-intersecting set families: a graph is normal if it admits a clique cover \(\mathcal{Q}\) and a stable set cover \(\mathcal{S}\) s.t. every clique in \(\cal Q\) intersects every stable set in \(\mathcal S\).
Anne Berry, Annegret K. Wagler
openaire   +2 more sources

Graph-based Class Testing.

Aust. Comput. J., 1994
In contrast to the explosion of activity in object-oriented design and programming, little attention has been given to object testing. Two tasks arise: (1) testing a base class C and (2) testing a class derived from C, assuming C has been thoroughly tested. We describe test inputs as traces: sequences of function calls.
Hoffman, Daniel, Strooper, Paul
openaire   +3 more sources

Graph Classes and Forbidden Patterns on Three Vertices

SIAM Journal on Discrete Mathematics, 2021
Laurent Feuilloley, Michel Habib
exaly  

Graph Classes and Graph Decompositions

2022
Carlos Hoppen, David P. Jacobs, Vilmar Trevisan   +2 more
openaire   +1 more source

Some new hereditary classes where graph coloring remains NP-hard

Discrete Mathematics, 2005
David Schindl
exaly  

On the number of minimal dominating sets on some graph classes

Theoretical Computer Science, 2015
Mathieu Liedloff
exaly