Related papers: Characterization of Circular-arc Graphs: II. McCon…
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a minimal forbidden induced subgraph characterization for the…
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a…
Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…
The existence of non-isomorphic graphs which share the same Laplace spectrum (to be referred to as isospectral graphs) leads naturally to the following question: What additional information is required in order to resolve isospectral…
An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without even holes and without diamonds can be decomposed via clique-separators into graphs…
We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any ($2K_{2}$, claw)-free graph with $\alpha(G) \geq 3$ is a split graph. Also, we apply it to characterize any pseudo-split graph.…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…
Circle graphs are the intersection graphs of chords in a circle. This paper presents the first sub-quadratic recognition algorithm for the class of circle graphs. Our algorithm is O(n + m) times the inverse Ackermann function, {\alpha}(n +…
In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw ($K_{1,3}$) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being connected,…
A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A…
Molecular chirality is actively researched in a variety of areas of biology, including biochemistry, physiology, pharmacology, etc., and today many chiral compounds are widely known to exhibit biological properties. The molecular structure…
A cycle $C$ of length $k$ in graph $G$ is extendable if there is another cycle $C'$ in $G$ with $V(C) \subset V(C')$ and length $k+1$. A graph is cycle extendable if every non-Hamiltonian cycle is extendable. In 1990 Hendry conjectured that…
Felsner introduced a cycle reversal, namely the `flip' reversal, for \alpha-orientations (i.e., each vertex admits a prescribed out-degree) of a graph G embedded on the plane and further proved that the set of all the \alpha-orientations of…
Circulant contraction minors play a key role for characterizing ideal circular matrices in terms of minimally non ideal structures. In this article we prove necessary and sufficient conditions for a circular matrix $A$ to have circulant…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
In this paper we introduce a new type of pattern -- a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at different levels of abstraction. They represent surprising…
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…