The k-point-arboricity of a graph
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Problem presented at the workshop in Krynica 2004”
The k-point-arboricity of a graph
Some applications of graph theory in the theory of hypergraphs
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
The determinant concept defined by means of graph theory
D. M. Cvetković (1975)
Matematički Vesnik
Similarity:
Discussing Graph Theory with a Computer III, Man-machine Theorem Proving
Dragoš M. Cvetković, Irena Pevac (1983)
Publications de l'Institut Mathématique
Similarity:
Decomposition of Certain Complete Bipartite Graphs into Prisms
Dalibor Froncek (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [1] Cichacz and Froncek established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn,n into generalized prisms of order 2n. In [2] and [3] Cichacz, Froncek, and Kovar showed decompositions of K3n/2,3n/2 into generalized prisms of order 2n. In this paper we...
A note on two comparability graphs
C. S., Jr. Johnson, Frederick R. McMorris (1982)
Mathematica Slovaca
Similarity:
A generalization of the friendship theorem
Marián Sudolský (1978)
Mathematica Slovaca
Similarity: