Results 111 to 120 of about 655,680 (212)
The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
The integer linear programming approach to structural learning of decomposable graphical models led us earlier to the concept of a chordal graph polytope.
Kratochvíl, Václav +5 more
core +1 more source
A Structural Description of Zykov and Blanche Descartes Graphs
ABSTRACT Around 1950, Zykov and Blanche Descartes proposed the two first explicit constructions of triangle‐free graphs with arbitrarily large chromatic number. We define a Zykov (resp. Blanche Descartes) graph as any induced subgraph of a graph created using Zykov's construction (resp. Blanche Descartes's).
Malory Marin +3 more
wiley +1 more source
Strongly chordal and chordal bipartite graphs are sandwich monotone
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pinar Heggernes +3 more
openaire +4 more sources
We provide a historic overview of microscopic soil structure characterization from its founding father, Walter Kubiëna, to several technical revolutions like automation, digitalization, and artificial intelligence. In addition to technical advancements, we explore how concepts and research questions have evolved in time.
Steffen Schlüter +3 more
wiley +1 more source
A new construction for vertex decomposable graphs [PDF]
Let G be a finite simple graph on the vertex set V(G) and let S⊆V(G). Adding a whisker to G at x means adding a new vertex y and edge xy to G where x∈V(G). The graph G∪W(S) is obtained from G by adding a whisker to every vertex of S. We prove that if G∖S
Nasser Hajisharifi, Abolfazl Tehranian
doaj
ABSTRACT Understanding how climate and vegetation structural complexity jointly shape fungal communities is essential for effective roadside slope restoration. To address this, we examined restoration effects on fungal diversity, community composition, and ecological networks across three climatically distinct regions: dry‐hot valley, subalpine, and ...
Min Wang +5 more
wiley +1 more source
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs
This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Ryuhei Uehara, et al.
core
Is DNA metabarcoding an option for formaldehyde‐preserved zooplankton time series?
Abstract The recovery of amplifiable DNA from formaldehyde‐fixed (FF) zooplankton samples has long been considered problematic, but advances in degraded‐DNA retrieval have renewed interest in FF samples. To access the information stored in long‐term zooplankton time series, we evaluated methods for extracting amplifiable DNA from community samples ...
Aitor Albaina +4 more
wiley +1 more source
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. This paper studies the complexity of the problem to determine the spanning tree congestion for non-sparse graph classes, while it was investigated for some ...
Yoshio Okamoto +3 more
doaj +1 more source
Treewidth of chordal bipartite graphs
Chordal bipartite graph are exactly those bipartite graph in which every cycle of length at least six has a chord. The treewidth of a graph G is the smallest maximum cliquesize among all chordal supergraphs of G decreased by one.
core

