相关论文: Resonance Graphs and Perfect Matchings of Graphs o…

Let $G$ be a plane bipartite graph and $\mathcal{M}(G)$ be the set of all perfect matchings of $G$. The resonance graph $R(G)$ is a graph whose vertex set is $\mathcal{M}(G)$, and two perfect matchings are adjacent in $R(G)$ if their…

It has recently been shown in [\emph{Discrete Appl. Math.} {\bf 366} (2025) 75--85] that the resonance graph of a plane elementary bipartite graph $G$ is a daisy cube if and only if $G$ is peripherally 2-colorable. Let $G$ be a peripherally…

A perfect matching in a graph $G$ is a set of nonadjacent edges covering every vertex of $G$. Motivated by recent progress on the relations between the eigenvalues and the matching number of a graph, in this paper, we aim to present a…

A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…

A matching in a graph $G$ is a set of independent edges in $G$. A perfect matching in a graph $G$ is a matching which saturates all the vertices of $G$. A fractional perfect matching in a graph $G$ is a function $h:E(G)\rightarrow [0,1]$…

Let $G$ be a plane elementary bipartite graph whose infinite face is forcing. We provide a bijection between the set of maximal hypercubes of its resonance graph and the set of maximal resonant sets of $G$, which generalizes a main result…

A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3. In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings…

A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…

A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is…

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…

A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…

A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bbb{N}\rightarrow\Bbb{N}$, such that if $H$ is a connected…

For a matching $M$ in a graph $G$, let $G(M)$ be the subgraph of $G$ induced by the vertices of $G$ that are incident with an edge in $M$. The matching $M$ is induced, if $G(M)$ is $1$-regular, and $M$ is uniquely restricted, if $M$ is the…

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…

Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal{A}$ be an arrangement of pseudolines intersecting the drawing of $G$. An aligned drawing of $G$ and $\mathcal{A}$ is a planar polyline drawing $\Gamma$ of $G$…

Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching. We call $G$ cycle-nice if for each even cycle $C$ of $G$, $G-V(C)$ has a…

Considering regions in a map to be adjacent when they have nonempty intersection (as opposed to the traditional view requiring intersection in a linear segment) leads to the concept of a facially complete graph: a plane graph that becomes…

We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even ring systems, as well as 2-connected outerplane bipartite…

Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…