The Gallai-Younger conjecture for planar graphs

DOI10.1007/BF01271273zbMath0880.05071OpenAlexW1980526181WikidataQ123305356 ScholiaQ123305356MaRDI QIDQ1375627

Bruce A. Reed, F. Bruce Shepherd

Publication date: 7 January 1998

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01271273

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (5)

Approximate min-max relations on plane graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ Coloring Jordan Regions and Curves ⋮ Packing and covering balls in graphs excluding a minor

Cites Work

• Unnamed Item
• A note on short cycles in digraphs
• Disjoint cycles in digraphs

This page was built for publication: The Gallai-Younger conjecture for planar graphs