Metrically regular square of metrically regular bigraphs. I
Vladimír Vetchý (1991)
Archivum Mathematicum
Similarity:
Vladimír Vetchý (1991)
Archivum Mathematicum
Similarity:
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fiol, M.A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ghorbani, Ebrahim, Koolen, Jack H., Yang, Jae Young (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sriraman Sridharan (2008)
RAIRO - Operations Research
Similarity:
We design a polynomial time algorithm for finding a -1)- regular subgraph in a -regular graph without any induced star (claw-free). A polynomial time algorithm for finding a cubic subgraph in a 4-regular locally connected graph is also given. A family of -regular graphs with an induced star (, not containing any (-1)-regular subgraph is also constructed.
Walter Carballosa, Ruy Fabila-Monroy, Jesús Leaños, Luis Manuel Rivera (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper we characterize precisely, for each value of k, which graphs have a regular k-token graph and which connected graphs have a planar k-token graph.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lorenzo Traldi (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition. We also deduce that up to isomorphism, K4 and K3,3 are the only 3-connected, 3-regular circle graphs.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: