A note on polynomials and -factors of graphs.

Shirazi, Hamed; Verstraëte, Jacques

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A note on polynomials and $f$ -factors of graphs.”

Regular spanning subgraphs of bipartite graphs of high minimum degree.

Csaba, Béla (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Saturation numbers of books.

Chen, Guantao, Faudree, Ralph J., Gould, Ronald J. (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On magic joins of graphs

Jaroslav Ivančo, Tatiana Polláková (2012)

Mathematica Bohemica

Similarity:

A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.