Dualizing cubic graph theory
T. McKee (1988)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “Perfect matchings in claw-free cubic graphs.”
Dualizing cubic graph theory
Perfect matching in general vs. cubic graphs : a note on the planar and bipartite cases
E. Bampis, A. Giannakos, A. Karzanov, Y. Manoussakis, I. Milis (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On domination in 2-connected cubic graphs.
Stodolsky, B.Y. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Matchings in infinite graphs
P. J. McCarthy (1978)
Czechoslovak Mathematical Journal
Similarity:
Factors of claw-free graphs
Zbigniew Lonc, Zdeněk Ryjáček (1991)
Czechoslovak Mathematical Journal
Similarity:
On cubic planar hypohamiltonian and hypotraceable graphs.
Araya, Makoto, Wiener, Gábor (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniquely edge colourable graphs
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
Secure sets and their expansion in cubic graphs
Katarzyna Jesse-Józefczyk, Elżbieta Sidorowicz (2014)
Open Mathematics
Similarity:
Consider a graph whose vertices play the role of members of the opposing groups. The edge between two vertices means that these vertices may defend or attack each other. At one time, any attacker may attack only one vertex. Similarly, any defender fights for itself or helps exactly one of its neighbours. If we have a set of defenders that can repel any attack, then we say that the set is secure. Moreover, it is strong if it is also prepared for a raid of one additional foe who can strike...