Structuring the elementary components of graphs having a perfect internal matching.

DOI10.1016/S0304-3975(02)00048-8zbMath1040.68066MaRDI QIDQ1874391

Miklós Krész, Miklós Bartha

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Graph matchingElementary graphAlternating pathCanonical partition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Tutte sets in graphs. II: The complexity of finding maximum Tutte sets ⋮ Tutte type theorems for graphs having a perfect internal matching ⋮ Soliton Automata with Multiple Waves ⋮ Unnamed Item ⋮ Soliton automata with constant external edges ⋮ The monoidal structure of Turing machines ⋮ SOLITON AUTOMATA BASED ON TREES

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic soliton automata with a single exterior node
• Soliton automata
• Automata represented by products of soliton automata
• Matching theory
• A structure theorem for maximum internal matchings in graphs
• Deterministic soliton automata with at most one cycle

This page was built for publication: Structuring the elementary components of graphs having a perfect internal matching.