Partitioning a planar graph without chordal 5-cycles into two forests
summary:It was known that the vertex set of every planar graph can be partitioned into three forests. We prove that the vertex set of a planar graph without chordal 5-cycles can be partitioned into two forests.
Wang, Yang +3 more
core +1 more source
Short- and Mid-Term Outcomes of Robotic Mitral Valve Repair for Degenerative Mitral Regurgitation in Octogenarians. [PDF]
Circ RepMachii Y +8 more
europepmc +1 more source
Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]
HeliyonAfridi MUK, Rehman IU, Ishaq M.
europepmc +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 2007 A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core
Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]
J Stat Theory PractRöttger F, Kahle T, Schwabe R.
europepmc +1 more source
The minimum size of a chordal graph with given order and minimum degree
A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree.
Zhang, Leilei, Zhan, Xingzhi
core
Orthology and near-cographs in the context of phylogenetic networks. [PDF]
Algorithms Mol BiolLindeberg A +3 more
europepmc +1 more source
Integrated single-cell RNA-seq and bulk RNA-seq analysis to investigate key adipogenesis genes in adipose-derived stem cells. [PDF]
PLoS OneZhang T, Cai Z, Li H, Li Z, Gan L, Mu D.
europepmc +1 more source
Exact and parameterized algorithms for choosability. [PDF]
Acta InformBliznets I, Nederlof J.
europepmc +1 more source