-универсальные квазимогообразия графов.
1 -Faktoren von Graphen.
1-perfect codes over self-complementary graphs
1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
A graph is 1-planar if it can be drawn in the Euclidean plane so that each edge is crossed by at most one other edge. A 1-planar graph on vertices is optimal if it has edges. We prove that 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (in the sense that each of the four color classes induces a subgraph of maximum degree one). Inspired by the decomposition of 1-planar graphs, we conjecture that every 1-planar graph is (2,2,2,0,0)-colorable.
A characterization of a class of graphs connected with the hysteresis phenomena
A combinatorial interpretation of homotopy groups of polyhedra
A deletion game on graphs: “Le Pic Arête".
A distance between isomorphism classes of trees
A generalization of a theorem of Turán for valuated graphs
A generalization of the dichromatic polynomial of a graph.
A generalization of the friendship theorem
A Generalized Direct Product Of Graphs
A generalized direct product of graphs.
A graph and its complement with specified properties. I: Connectivity.
A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.
A metric for graphs
A metric graph satisfying [...] w 4 1 = 1 that cannot be lifted to a curve satisfying [...] dim ( W 4 1 ) = 1
For all integers g ≥ 6 we prove the existence of a metric graph G with [...] w41=1 such that G has Clifford index 2 and there is no tropical modification G′ of G such that there exists a finite harmonic morphism of degree 2 from G′ to a metric graph of genus 1. Those examples show that not all dimension theorems on the space classifying special linear systems for curves have immediate translation to the theory of divisors on metric graphs.
A model theory approach to structural limits
The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an example, we generalize limits of bounded degree graphs from subgraph testing to finite model testing.
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
A non graph theory approach to Ulam's conjecture