Related papers: Naji's characterization of circle graphs

We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.

In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…

I present a simple derivation of the de Gennes narrowing phenomenon.

A well-known theorem of Blind and Mani says that every simple polytope is uniquely determined by its graph. Kalai gave a very short and elegant proof of this result using the concept of acyclic orientations. As it turns out, Kalai's proof…

We provide a short proof of the 1-dimensional flat chain conjecture.

We give a characterization of the rational normal curve in terms of the rank function associated to a curve.

Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc…

We classify all normal edge ideals of edge-weighted graphs.

In this paper, we give a necessary condition for a diagram to represent the trivial knot.

We study topological properties of the graph topology.

We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.

A Cayley graph is said to be an NNN-graph if it is both normal and non-normal for isomorphic regular groups, and a group has the NNN-property if there exists an NNN-graph for it. In this paper we investigate the NNN-property of cyclic…

This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.

We give a new simpler proof of a theorem of Jayne and Rogers.

In this paper, we give a new class of reconstructible graphs, which is an extension of my paper `A class of reconstructible graphs'.

A new complete invariant for acyclic graphs is presented

A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there…

We introduce the tautological rings of moduli stacks of twisted curves and establish some basic properties.

We give an elementary, self-contained and quick proof of Belyi's theorem. As a by-product of our proof we obtain an explicit bound for the degree of the defining number field of a Belyi surface.

A new generalization of the classical separate algebraicity theorem is suggested and proved.