Results 291 to 300 of about 142,988 (312)

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   +1 more source

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

Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes

Journal of Computer and System Sciences, 2023
Diptapriyo Majumdar, Venkaṭesh Raman
exaly  

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

Graph classes with structured neighborhoods and algorithmic applications

Theoretical Computer Science, 2013
Remy Belmonte
exaly  

Some new hereditary classes where graph coloring remains NP-hard

Discrete Mathematics, 2005
David Schindl
exaly  

Graph isomorphism for graph classes characterized by two forbidden induced subgraphs

Discrete Applied Mathematics, 2017
Pascal Schweitzer
exaly  

Graph Controllability Classes for the Laplacian Leader-Follower Dynamics

IEEE Transactions on Automatic Control, 2015
Cesar O Aguilar, Bahman Gharesifard
exaly  

On the number of minimal dominating sets on some graph classes

Theoretical Computer Science, 2015
Mathieu Liedloff
exaly