## Found 17 Documents (Results 1–17)

100
MathJax

### Well-partitioned chordal graphs. (English)Zbl 07541590

MSC:  05C70 05C40 68Q17
Full Text:

### Spiders everywhere. (English)Zbl 1454.05068

MSC:  05C45 05C05
Full Text:

### Intersection of longest paths in graph classes. (English)Zbl 1440.05075

MSC:  05C12 05C38
Full Text:

Full Text:

Full Text:

### Nonempty intersection of longest paths in $$2K_2$$-free graphs. (English)Zbl 1388.05099

MSC:  05C38 05C69
Full Text:

### Gallai’s question and constructions of almost hypotraceable graphs. (English)Zbl 1387.05072

MSC:  05C12 05C38
Full Text:

### Bounding the distance among longest paths in a connected graph. (English)Zbl 1380.05109

MSC:  05C38 05C12 05C40
Full Text:

### Transversals of longest paths. (English)Zbl 1383.05073

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 135-140 (2017).
MSC:  05C12 05C38 05C40
Full Text:

### Nonempty intersection of longest paths in series-parallel graphs. (English)Zbl 1351.05123

MSC:  05C38 05C12 05C10
Full Text:

### Intersection of longest paths in graph classes. (English)Zbl 1356.05031

Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 139-142 (2016).
Full Text:

Full Text:

Full Text:

MSC:  05C38
Full Text:

Full Text:

### Intersection of longest paths in a graph. (English)Zbl 1274.05263

Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 743-748 (2011).
MSC:  05C38
Full Text:

MSC:  05C38
Full Text:

all top 5