On graphs with prescribed edge neighbourhoods
Dalibor Fronček (1989)
Commentationes Mathematicae Universitatis Carolinae
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 “Maximum degree growth of the iterated line graph.”
On graphs with prescribed edge neighbourhoods
Maximal pentagonal packings.
Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On decompositions of complete graphs into three factors with given diameters
Pavel Hrnčiar (1990)
Czechoslovak Mathematical Journal
Similarity:
The 1 , 2 , 3-Conjecture And 1 , 2-Conjecture For Sparse Graphs
Daniel W. Cranston, Sogol Jahanbekam, Douglas B. West (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The 1, 2, 3-Conjecture states that the edges of a graph without isolated edges can be labeled from {1, 2, 3} so that the sums of labels at adjacent vertices are distinct. The 1, 2-Conjecture states that if vertices also receive labels and the vertex label is added to the sum of its incident edge labels, then adjacent vertices can be distinguished using only {1, 2}. We show that various configurations cannot occur in minimal counterexamples to these conjectures. Discharging then confirms...
-saturated graphs of minimum size
Zsolt Tuza (1989)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity: