Matchings in infinite graphs
P. J. McCarthy (1978)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Factors of claw-free graphs”
Matchings in infinite graphs
Recognizing the -structure of claw-free graphs and a larger graph class.
Babel, Luitpold, Brandstädt, Andreas, Le, Van Bang (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Minimal claw-free graphs
P. Dankelmann, Henda C. Swart, P. van den Berg, Wayne Goddard, M. D. Plummer (2008)
Czechoslovak Mathematical Journal
Similarity:
A graph is a minimal claw-free graph (m.c.f. graph) if it contains no (claw) as an induced subgraph and if, for each edge of , contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs.
On a generalization of perfect -matching
Ľubica Šándorová, Marián Trenkler (1991)
Mathematica Bohemica
Similarity:
The paper is concerned with the existence of non-negative or positive solutions to , where is the vertex-edge incidence matrix of an undirected graph. The paper gives necessary and sufficient conditions for the existence of such a solution.