Results 81 to 90 of about 131 (107)

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

Applications of magnesium iodide structure via modified-polynomials. [PDF]

Sci Rep
Ghazwani H, Jamil MK, Ahmad A, Azeem M, Koam ANA.   +4 more
europepmc   +1 more source

A 4 3 -approximation for the maximum leaf spanning arborescence problem in DAGs. [PDF]

Math Program
Neuwohner M.
europepmc   +1 more source

Rigidity of Symmetric Frameworks on the Cylinder. [PDF]

Discrete Comput Geom
Nixon A, Schulze B, Wall J.
europepmc   +1 more source

Diverse collections in matroids and graphs. [PDF]

Math Program
Fomin FV, Golovach PA, Panolan F, Philip G, Saurabh S.   +4 more
europepmc   +1 more source

Odd disjoint trails and totally odd graph immersions [PDF]

, 2017
Churchley, Ross
core  

Rectangular table negotiation problem revisited

Open Mathematics, 2011
Froncek Dalibor, Kubesa Michael
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Matchings in graphs from the spectral radius

Linear and Multilinear Algebra, 2023
Suil O, Minjae Kim
exaly  

The matching number and Hamiltonicity of graphs

AKCE International Journal of Graphs and Combinatorics, 2020
Rao Li
exaly