Results 111 to 120 of about 969,499 (193)
A (k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj
Structure Properties of Generalized Farey graphs based on Dynamical Systems for Networks. [PDF]
Jiang W, Zhai Y, Martin P, Zhao Z.
europepmc +1 more source
Comparison and enumeration of chemical graphs. [PDF]
Akutsu T, Nagamochi H.
europepmc +1 more source
Finding Cactus Roots in Polynomial Time. [PDF]
Golovach PA +3 more
europepmc +1 more source
Charge group partitioning in biomolecular simulation. [PDF]
Canzar S +7 more
europepmc +1 more source
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]
Aichholzer O +4 more
europepmc +1 more source
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]
Aurenhammer F, Walzl G.
europepmc +1 more source
Leveraging graphical model techniques to study evolution on phylogenetic networks. [PDF]
Teo B, Bastide P, Ané C.
europepmc +1 more source
The multi-stripe travelling salesman problem. [PDF]
Çela E, Deineko VG, Woeginger GJ.
europepmc +1 more source

