Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the number of rooted c-nets of R. C.
PNAS is the world's most-cited multidisciplinary scientific serial. It publishes high-impact research reports, commentaries, perspectives, reviews, colloquium papers, and actions of the Academy. In ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results