Results 11 to 20 of about 3,613,364 (137)
Maximal independence and regularity of Al/Si distributions in disordered phyllosilicates 2:1. [PDF]
Acta Crystallogr A Found AdvThe distribution of aluminium cations in disordered phyllosilicates is analysed according to the concepts of maximal independence and regularity.As an extension of previous works, we analyse regularity in disordered Al/Si distributions in phyllosilicates 2:1. The method is based on an analysis of maximal independent sets in a labelled quotient graph of
Moreira de Oliveira M, Eon JG.
europepmc +2 more sources
Local certification of forbidden subgraphs [PDF]
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local
Zeitoun, Sébastien +4 more
core +9 more sources
On minimal forbidden subgraph characterizations of balanced graphs [PDF]
, 2013 Artículo de publicación ISIA graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix.
Safe, Martín D. +9 more
core +2 more sources
Planar graph coloring with forbidden subgraphs : why trees and paths are dangerous [PDF]
, 2002 We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem.
Penttonen, M. +5 more
core +2 more sources
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L, Letchford, A N
core +5 more sources
The Ryjáček Closure and a Forbidden Subgraph [PDF]
, 2016 The Ryjáček closure is a powerful tool in the study of Hamiltonian properties of claw-free graphs. Because of its usefulness, we may hope to use it in the classes of graphs defined by another forbidden subgraph. In this note, we give a negative answer to
Xiong Liming +3 more
core +1 more source
A semi-induced subgraph characterization of upper domination perfect graphs [PDF]
, 1999 Let β(G) and Γ(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classes of
Zverovich, Vadim +3 more
core +3 more sources
On Sequential Heuristic Methods for the Maximum Independent Set Problem
Discussiones Mathematicae Graph Theory, 2017 We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3].
Lê Ngoc C. +2 more
doaj +1 more source
Heavy subgraph pairs for traceability of block-chains
Discussiones Mathematicae Graph Theory, 2014 A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type ...
Li Binlong +2 more
doaj +1 more source
On characterizing game-perfect graphs by forbidden induced subgraphs [PDF]
, 2012 A graph $G$ is called $g$-perfect if, for any induced subgraph $H$ of $G$, the game chromatic number of $H$ equals the clique number of $H$. A graph $G$ is called $g$-col-perfect if, for any induced subgraph $H$ of $G$, the game coloring number of $H ...
Andres, Stephan Dominique
core +1 more source