A simple proof of a theorem by Tutte.
Hetyei, Gábor (1999)
Mathematica Pannonica
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.
Displaying similar documents to “A degree condition for the existence of -factors with prescribed properties.”
A simple proof of a theorem by Tutte.
-saturated graphs of minimum size
Zsolt Tuza (1989)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
On the total domination subdivision numbers in graphs
Seyed Sheikholeslami (2010)
Open Mathematics
Similarity:
A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number γ t(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sdγt (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. Karami, Khoeilar, Sheikholeslami and Khodkar,...
The graph of labellings of a given graph
Bohdan Zelinka (1988)
Mathematica Slovaca
Similarity:
A note on -free precolouring with colours.
Rackham, Tom (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Even bonds of prescribed directed parity.
Hartmann, Sven, Little, C.H.C. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: