Related papers: The triconnected Kontsevich graph complex

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…

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph.

The paper shows that almost every $n$-vertex graph is such that the multiset of its induced subgraphs on $3 \log_2{n}$ vertices is sufficient to determine it up to isomorphism. Therefore, for checking the isomorphism of a pair of $n$-vertex…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

A perfect graph is a graph which every induced subgraph has clique number equal to chromatic number. In this paper, I will introduce a new family of graphs, the quasiperfect graphs which generalizes the perfect graphs.

Motivated by recent results in graph C*-algebras concerning an equivariant pushout structure of the Vaksman-Soibelman quantum odd spheres, we introduce a class of graphs called trimmable. Then we show that the Leavitt path algebra of a…

We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.

Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.

An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…

We study the deformation complex of the dg wheeled properad of $\mathbb{Z}$-graded quadratic Poisson structures and prove that it is quasi-isomorphic to the even M. Kontsevich graph complex. As a first application we show that the…

In this paper we discuss the connected components of underlying graphs of halving lines' configurations. We show how to create a configuration whose underlying graph is the union of two given underlying graphs. We also prove that every…

We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.

This work re-examines a classical construction of a 2-connected (simple) graph where every intermediate graph is 2-connected before detailing an analogous construction for 3-connected graphs which requires a graph equivalence relation…

A graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths. We reinvestigate a recent constructive characterization of uniformly $3$-connected…

We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph.

Let $G$ be a locally compact group with cocompact connected component. We prove that the assembly map from the topological $\k$-theory of $G$ to the $\k$-theory of the reduced $C^*$-algebra of $G$ is an isomorphism.

We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…

We formulate the notion of an isomorphism of GKM graphs. We then show that two GKM graphs have isomorphic graph equivariant cohomology algebras if and only if the graphs are isomorphic.

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…