Nonempty intersection of longest paths in a graph with a small matching number

Title:

Nonempty intersection of longest paths in a graph with a small matching number

Creator:

Chen, Fuyuan

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:7d545341-0722-4349-bd74-797758933899
uuid:7d545341-0722-4349-bd74-797758933899
issn:0011-4642

Subject:

longest path, matching number, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

A maximum matching of a graph G is a matching of G with the largest number of edges. The matching number of a graph G, denoted by {\alpha }'(G), is the number of edges in a maximum matching of G. In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture is true for every connected graph G with {\alpha }'(G)\leq 3., Fuyuan Chen., and Obsahuje seznam literatury

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

545-553

Source:

Czechoslovak Mathematical Journal | 2015 Volume:65 | Number:2

Harvested from:

CDK

Metadata only:

false