Results 21 to 30 of about 44 (43)
The Unit Bar Visibility Number of a Graph
A $t$-unit-bar representation of a graph $G$ is an assignment of sets of at most $t$ horizontal unit-length segments in the plane to the vertices of $G$ so that (1) all of the segments are pairwise nonintersecting, and (2) two vertices $x$ and $y$ are ...
Emily Gaub, Michelle Rose, Paul Wenger
doaj +1 more source
The classification of partially symmetric 3-braid links
We classify 3-braid links which are amphicheiral as unoriented links, including a new proof of Birman- Menasco’s result for the (orientedly) amphicheiral 3-braid links. Then we classify the partially invertible 3-braid links.
Stoimenov Alexander
doaj +1 more source
Archimedean tiling graphs with Gallai’s property
Gallai in 1966 raised the question about the existence of graphs with the property that every vertex is missed by some longest path. This property will be called Gallai’s property.
Chang Zhikui, Yuan Liping
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Circle graphs are quadratically χ‐bounded
Bulletin of the London Mathematical Society, 2021Rose McCarty
exaly
A few weight systems arising from intersection graphs
Michigan Mathematical Journal, 2003Blake Mellor
exaly
Compressed polytopes, initial ideals and complete multipartite graphs
Illinois Journal of Mathematics, 2000Hidefumi Ohsugi
exaly
Separation Dimension of Bounded Degree Graphs
SIAM Journal on Discrete Mathematics, 2015Deepak Rajendraprasad +2 more
exaly
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
SIAM Journal on Discrete Mathematics, 2008Cedric Chauve +2 more
exaly

