Cordial deficiency.
Riskin, Adrian (2007)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Displaying similar documents to “Cyclic connectivity classes of directed graphs.”
Cordial deficiency.
Calculating the number of the linear factors in planar graphs.
Saoud, Mahmoud, Al-Khanaifes, Kaled (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Degree-constrained edge partitioning in graphs arising from discrete tomography.
Bentz, Cedric, Costa, Marie-Christine, Picouleau, Christophe, Ries, Bernard, De Werra, Dominique (2009)
Journal of Graph Algorithms and Applications
Similarity:
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Expected lengths of minimum spanning trees for non-identical edge distributions.
Li, Wenbo V., Zhang, Xinyi (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Graph connectivity and Wiener index
I. Gutman, S. Zhang (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
A not on dominating set with Maple.
Matinfar, M., Mirzamani, S. (2008)
The Journal of Nonlinear Sciences and its Applications
Similarity:
On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
The decomposition of a generalized graph into isomorphic subgraphs
Bohdan Zelinka (1968)
Časopis pro pěstování matematiky
Similarity:
The Turàn number of the graph 3P4
Halina Bielak, Sebastian Kieliszek (2014)
Annales UMCS, Mathematica
Similarity:
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)
A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: