Results 91 to 100 of about 235 (177)
Journal of Combinatorial Theory, Series A, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Herzog +2 more
openaire +1 more source
iMetaOmics, EarlyView.Advances in sequencing and mass spectrometry have propelled life sciences into the multi‐omics era. Metabolomics and microbiomics are widely applied across various research fields, yet massive data analysis faces challenges like limited tool functionality and high technical barriers.
Jianhua Zhao +16 more
wiley +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2016 We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
Connected graph searching in chordal graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Vizing’s conjecture for chordal graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ron Aharoni, Tibor Szabó
openaire +2 more sources
Weak Degeneracy of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn +2 more
wiley +1 more source
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
Explicit 3‐colorings for Exponential Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento +2 more
wiley +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source