Results 61 to 70 of about 3,613,364 (137)
Forbidden Subgraph Problems with Predictions [PDF]
In the Online Delayed Connected H-Node-Deletion Problem, an unweighted graph is revealed vertex by vertex and it must remain free of any induced copies of a specific connected induced forbidden subgraph H at each point in time.
Komm, Dennis +3 more
core
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
Minimal forbidden subgraphs of reducible graph properties [PDF]
, 2001 A property of graphs is any class of graphs closed under isomorphism. Let ₁,₂,...,ₙ be properties of graphs. A graph G is (₁,₂,...,ₙ)-partitionable if the vertex set V(G) can be partitioned into n sets, {V₁,V₂,..., Vₙ}, such that for each i = 1,2,...,n ...
Berger, Amelie
core +1 more source
Relative timing information and orthology in evolutionary scenarios. [PDF]
Algorithms Mol Biol, 2023 Schaller D +5 more
europepmc +1 more source
Long induced paths in sparse graphs and graphs with forbidden patterns
26 pages, 8 figures. Comments welcome !Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path?
Raymond, Jean-Florent +2 more
core +6 more sources
The clique-width of bipartite graphs in monogenic classes
, 2008 In this paper, we provide complete classification of classes of bipartite graphs defined by a single forbidden induced bipartite subgraph with respect to bounded/unbounded clique ...
Lozin, Vadim V., Volz, Jordan
core +1 more source
Graph colourings with forbidden k-coloured subgraphs
, 2013 Click on the link to view the abstract.Keywords: Generalised colouring, forbidden subgraph, graph propertyQuaestiones Mathematicae 36(2013), 537 ...
Dorfling, Michael J, Dorfling, Samantha
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
The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages
, 2014 A graph class is called A-free if every graph in the class has no graph in the set A as an induced subgraph. Such characterisations by forbidden induced subgraphs are (among other purposes) very useful for determining whether A-free is a subclass of B ...
de Ridder, Hendrik Nicolaas +3 more
core +1 more source