Results 41 to 50 of about 875,640 (148)

Small Superpatterns for Dominance Drawing

open access: yes, 2013
We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets for certain types of dominance drawing and on superpatterns for certain ...
Bannister, Michael J.   +2 more
core   +1 more source

Convex-Arc Drawings of Pseudolines [PDF]

open access: yes, 2016
A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once.
Eppstein, David   +3 more
core   +1 more source

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]

open access: yes
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Laskar, R.C., Mulder, H.M., Novick, B.
core   +1 more source

The outerplanar crossing number of the complete bipartite graph

open access: yesDiscrete Applied Mathematics, 2022
B. Ábrego, S. Fernández-Merchant
semanticscholar   +1 more source

Counting Rules for Computing the Number of Independent Sets of a Grid Graph

open access: yesMathematics
The issue of counting independent sets of a graph, G, represented as i(G), is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics, and
Guillermo De Ita Luna   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy