Results 61 to 66 of about 99 (66)

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

Math Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc   +1 more source

EXTREME VALUES OF THE FIEDLER VECTOR ON TREES. [PDF]

Linear Algebra Appl
Lederman RR, Steinerberger S.
europepmc   +1 more source

A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups. [PDF]

Math Ann
Gollin JP, Hendrey K, Kwon OJ, Oum SI, Yoo Y.   +4 more
europepmc   +1 more source

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]

Discrete Comput Geom
Aichholzer O, García A, Tejel J, Vogtenhuber B, Weinberger A.   +4 more
europepmc   +1 more source

Disjoint triangles and quadrilaterals in a graph

Open Mathematics, 2008
Wang Hong
doaj   +1 more source