Girth, minimum degree and transversals of longest paths

zbMATH Open1223.05096MaRDI QIDQ547535FDOQ547535

Authors: Ricardo Gómez, Juan José Montellano-Ballesteros, Hortensia Galeana-Sánchez 

Publication date: 4 July 2011

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• Independent transversals of longest paths in locally semicomplete and locally transitive digraphs
• Independent sets which meet all longest paths
• Intersecting longest paths in chordal graphs
• Stable set meeting every longest path
• Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs

zbMATH Keywords

minimum degreetransversalgirthlongest path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cited In (4)

• Independent transversals of longest paths in locally semicomplete and locally transitive digraphs
• Independent detour transversals in 3-deficient digraphs
• Stable set meeting every longest path
• Independent sets and non-augmentable paths in generalizations of tournaments

This page was built for publication: Girth, minimum degree and transversals of longest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547535)