Results 101 to 110 of about 3,384,024 (197)
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
Discret. Math., 2019 Considering connected $K_{1,3}$-free graphs with independence number at least $3$, Chudnovsky and Seymour (2010) showed that every such graph, say $G$, is $2ω$-colourable where $ω$ denotes the clique number of $G$. We study $(K_{1,3}, Y)$-free graphs, and show that the following three statements are equivalent.
Brause, Christoph +5 more
openaire +6 more sources
Forbidden induced subgraphs for threshold-like graph classes [PDF]
, 2019 Every hereditary graph class (closed under induced subgraphs) has a characterization by forbidden induced subgraphs: graphs not in the class but every graph obtained by deleting a vertex is in the class.
Sivaraman, Vaidyanathan
core +1 more source
Hadwiger’s Conjecture with Certain Forbidden Induced Subgraphs
Experimental MathematicsWe prove that $\{\overline{K_3}, H\}$-free graphs are not counterexamples to Hadwiger's Conjecture, where $H$ is any one of 33 graphs on seven, eight, or nine vertices, or $H=K_8$. This improves on past results of Plummer-Stiebitz-Toft, Kriesell, and Bosse. The proofs are mostly computer-assisted.
openaire +3 more sources
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams
CoRR, 2018 We propose a general method performed over multivalued decision diagrams that enumerates all subgraphs of an input graph that are characterized by input forbidden induced subgraphs. Our method combines elaborations of classical set operations and the developing construction technique, called the frontier based search, for multivalued decision diagrams.
Jun Kawahara +3 more
openaire +3 more sources
Informatika, 2018 A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj
Relative timing information and orthology in evolutionary scenarios. [PDF]
Algorithms Mol Biol, 2023 Schaller D +5 more
europepmc +1 more source
Subgraph Induced Connectivity Augmentation [PDF]
, 2003 Given a planar graph G=(V,E) and a vertex set Wsubseteq V , the subgraph induced planar connectivity augmentation problem asks for a minimum cardinality set F of additional edges with end vertices in W such that G'=(V,Ecup F) is planar and the subgraph ...
Gutwenger, Carsten +5 more
core +2 more sources
, 2015 Menu from Forbidden Palace restaurant in Los Angeles, CA. Special lunch, Chinese family dinners, soups, chop suey, chow mein, chicken, wun ton, soup noodles, shrimps, spareribs, eggs, squab and duck, rice, miscellaneous, cocktails, mixed drinks, rums ...
Forbidden Palace
core
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Algorithmica, 2022 Jelínek V +4 more
europepmc +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source