On some regularities of graphs. I.
Jerzy Płonka (1982)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “The nonexistence of regular near octagons with parameters .”
On some regularities of graphs. I.
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
Dingguo Wang, Erfang Shan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex. In this paper we establish upper bounds on the numbers of end-blocks and cut-vertices in a 4-regular graph G and claw-free 4-regular graphs. We characterize the extremal graphs achieving these bounds.
Tiling tripartite graphs with 3-colorable graphs.
Martin, Ryan, Zhao, Yi (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Clark, W.Edwin, Dunning, Larry A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs in which each pair of vertices has exactly two common neighbours
Bohdan Zelinka (1993)
Mathematica Bohemica
Similarity:
The paper studies graphs in which each pair of vertices has exactly two common neighbours. It disproves a conjectury by P. Hliněný concerning these graphs.
All graphs in which each pair of distinct vertices has exactly two common neighbors
Dragan Stevanović (2005)
Mathematica Bohemica
Similarity:
We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.
New prolific constructions of strongly regular graphs.
Fon-Der-Flaass, Dmitry G. (2002)
Advances in Geometry
Similarity: