Results 161 to 170 of about 566 (185)
Machine Learning-Driven Design of Fluorescent Materials: Principles, Methodologies, and Future Directions. [PDF]
Nanomaterials (Basel)Bian Q, Wang X.
europepmc +1 more source
On the forbidden induced subgraph sandwich problem
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Simone Dantas +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Forbidden induced subgraphs for toughness
J. Graph Theory, 2013Summary: Let \(\mathcal F\) be a family of connected graphs. A graph \(G\) is said to be \(\mathcal F\)-free if \(G\) is \(H\)-free for every graph \(H\) in \(\mathcal F\). We study the relation between forbidden subgraphs in a connected graph \(G\) and the resulting toughness of \(G\). In particular, we consider the problem of characterizing the graph
Katsuhiro Ota, Gabriel Sueiro
openaire +2 more sources
Forbidden Induced Subgraphs for Perfect Matchings
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhiro Ota, Gabriel Sueiro
openaire +1 more source
Forbidden induced subgraph characterization of cograph contractions
Journal of Graph Theory, 2004AbstractLet S1, S2,…,St be pairwise disjoint non‐empty stable sets in a graph H. The graph H* is obtained from H by: (i) replacing each Si by a new vertex qi; (ii) joining each qi and qj, 1 ≤ i # j ≤ t, and; (iii) joining qi to all vertices in H – (S1 ∪ S2 ∪ ··· ∪ St) which were adjacent to some vertex of Si. A cograph is a P4‐free graph.
Igor E. Zverovich, Inessa I. Zverovich
exaly +3 more sources
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
SIAM Journal on Discrete Mathematics, 2008The leaf graph of a connected graph is obtained by joining a new vertex of degree one to each noncutting vertex. We prove that if a connected graph $G$ is not dominated by any of its induced paths, then $G$ is dominated by a connected induced subgraph whose leaf graph, too, is an induced subgraph of $G$. It follows that, for every nonempty class ${\cal
Zsolt Tuza
exaly +2 more sources
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
2001We give a complete characterization of parameter graphs H for which the problem of coloring H-free graphs is polynomial and for which it is NP-complete. We further initiate a study of this problem for two forbidden subgraphs.
Král, D. +3 more
openaire +1 more source
Polynomial $$\chi $$ χ -Binding Functions and Forbidden Induced Subgraphs: A Survey
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ingo Schiermeyer +2 more
exaly +3 more sources