This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.

This paper shows that for every graph, there exist a certain number of vertex-disjoint cycles of different lengths, or a smaller set of vertices such that the graph without these vertices has fewer cy…

The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.

The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.

This paper studies set-defined graph classes and proves that bounded unions of shift-colorable graphs form the fundamental obstruction to chromatic number boundness in these classes.

This paper disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.

This paper constructs a cubic graph with a polyhedral map whose automorphism groups are isomorphic to a given finite group.

This paper presents new polynomial-time algorithms for determining the winner of the unbiased triangle game on the edge set of general graphs using the edge-triangle incidence graph.

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.