Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penni...
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...