Depth first search in claw-free graphs

DOI10.1007/s11590-017-1211-0zbMath1400.90292OpenAlexW2686495582MaRDI QIDQ1744633

Gábor Wiener

Publication date: 19 April 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/40508/1/clawfree.pdf

zbMATH Keywords

spanning treeclaw-free graphdepth first search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Hamilton cycles in 5-connected line graphs
• On a closure concept in claw-free graphs
• Spanning spiders and light-splitting switches
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
• On finding spanning trees with few leaves
• Longest paths and cycles in K1,3-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Depth first search in claw-free graphs