Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

For pairs of type IIIλ (0 < λ ≦ 1) factors with finite indices, we shall show a necessary and sufficient condition that the type II principal graph does not coincide with the type III principal graph, ...

As a branch of graph theory, Graph drawing applies topology and geometry to derive two- and three-dimensional representations of graphs. Graph drawing is motivated by applications such as VLSI circuit ...

For any integer 𝑘 ≥ 2, a graph 𝐺 is called 𝑘-leaf-connected if |V(G)|≥k+1 and given any subset 𝑆 ⊆ 𝑉(𝐺) with |S|=k,G always has a spanning tree 𝑇 such that 𝑆 is precisely the set of leaves of ...

Text: : "Graph Theory" by J. Adrian Bondy and U.S.R. Murty; Graduate Texts in Mathematics 244, Springer 2008. ISBN 978-1-84628-969-9, 2nd printing, 978-1-84628-970-5 (ebook). Notes will be supplied ...

An innovative approach to solving a stubborn, but elementary, question in graph theory — the mathematical study of networks of nodes and their connections — may signal the first major theoretical ...

Gallai–Ramsey theory lies at the intersection of graph colouring and Ramsey theory, providing a framework for understanding how structures emerge in edge-coloured graphs. Central to this domain is the ...