相关论文: Confluent Layered Drawings

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…

Edges, boundaries and contours are important subjects of study in both computer graphics and computer vision. On one hand, they are the 2D elements that convey 3D shapes, on the other hand, they are indicative of occlusion events and thus…

In this paper, we give a family of online algorithms for the classical coloring problem of intersection graphs of discs with bounded diameter. Our algorithms make use of a geometric representation of such graphs and are inspired by an…

Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…

We study the problem of transforming bipartite graphs into bicluster graphs. Abu-Khzam, Isenmann, and Merchad [IWOCA '25] introduced two variants of this problem. In both problems, the goal is to transform a bipartite graph into a bicluster…

We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell…

An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this…

In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by Fiam{\v{c}}ik (1978) and Alon, Sudakov and Zaks (2001) states that every simple graph…

An edge labeling of a graph distinguishes neighbors by sets (multisets, resp.), if for any two adjacent vertices $u$ and $v$ the sets (multisets, resp.) of labels appearing on edges incident to $u$ and $v$ are different. In an analogous way…

Image tracing is a foundational component of the workflow in graphic design, engineering, and computer animation, linking hand-drawn concept images to collections of smooth curves needed for geometry processing and editing. Even for clean…

We determine which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.

A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding…

The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…

The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…

We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…

The visualization of any graph plays important role in various aspects, such as graph drawing software. Complex systems (like large databases or networks) that have a graph structure should be properly visualized in order to avoid…

Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…

In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…