Results 91 to 100 of about 587,547 (217)
Journal of Graph Theory, EarlyView.ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
New graph classes characterized by weak vertex separators and two-pairs
AKCE International Journal of Graphs and Combinatorics, 2017 A set of vertices whose deletion from a graph would increase the distance between two remaining vertices is called a weak vertex separator of the graph. Two vertices form a two-pair if all chordless paths between them have length .
Terry A. McKee
doaj +1 more source
The Minimal Nonplanar Strong Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of K 5 ${K}_{5}$ and of K 3 , 3 ${K}_{3,3}$. Here we study the minimal (under subdigraph containment) strongly‐connected digraphs that are not planar.
Stephen Bartell, Paul Seymour
wiley +1 more source
Cohen–Macaulay chordal graphs [PDF]
, 2006 We classify all Cohen–Macaulay chordal graphs.
Herzog, Jürgen +2 more
core +1 more source
Journal of Plant Nutrition and Soil Science, EarlyView.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
Componentwise linearity of ideals arising from graphs
Le Matematiche, 2008 Let G be a simple undirected graph on n vertices.
Veronica Crispin, Eric Emtander
doaj
The Black-and-White Coloring Problem on Chordal Graphs
Journal of Graph Algorithms and Applications, 2012 Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. This
Shira Zucker
doaj +1 more source
Characterizations and algorithmic applications of chordal graph embeddings [PDF]
, 1997 We introduce the separator graph for a given graph G and show a 1-1 correspondence between its maximal cliques and the minimal triangulations (i.e., ⊆-minimal chordal embeddings) of G.
Scheffler, Petra, Parra, Andreas
core +1 more source
Is DNA metabarcoding an option for formaldehyde‐preserved zooplankton time series?
Limnology and Oceanography: Methods, EarlyView.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
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs
, 2004 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