Minimal size of a graph with diameter 2 and given maximal degree. II.
Minimale nicht in die Ringfläche einbettbare Graphen.
Minimum congestion spanning trees of grids and discrete toruses
The paper is devoted to estimates of the spanning tree congestion for grid graphs and discrete toruses of dimensions two and three.
Minimum maximal graphs with forbidden subgraphs
Modèles d'optimisation en analyse des données relationnelles
Moderní pohled na „jistý problém minimální‟
Moore graphs and beyond: a survey of the degree/diameter problem.
More constructions for Turan's (3,4)-conjecture.
Multigraphs (only) satisfy a weak triangle removal lemma.
Multi-polarized graphs
Nearly complete graphs decomposable into large induced matchings and their applications
We describe two constructions of (very) dense graphs which are edge disjoint unions of large induced matchings. The first construction exhibits graphs on vertices with edges, which can be decomposed into pairwise disjoint induced matchings, each of size . The second construction provides a covering of all edges of the complete graph by two graphs, each being the edge disjoint union of at most induced matchings, where . This disproves (in a strong form) a conjecture of Meshulam, substantially...
New lower bounds for orthogonal drawings.
New proofs of the uniqueness of extremal noneven digraphs.
New results about impartial solitaire clobber
Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber, introduced by Albert et al. in 2002. The initial configuration of Impartial Solitaire Clobber is a graph, such that there is a stone placed on each of its vertex, each stone being black or white. A move of the game consists in picking a stone, and clobbering an adjacent stone of the opposite color. By clobbering we mean that the clobbered stone is removed from the graph, and replaced by the clobbering one....
New upper bounds on the order of cages.
Nonexistence of graphs with cyclic defect.
Non-Hamiltonian Square-minus-two.
Non-planar network with edges subject to failure and enumeration of proper cuts
Note on Hamilton Circuits and Hamilton Paths.
Note on linear arboricity