Deterministic soliton graphs

zbMATH Open1107.68061MaRDI QIDQ3418606FDOQ3418606

Authors: Miklós Bartha, Miklós Krész 

Publication date: 5 February 2007

Recommendations

• Deciding the deterministic property for soliton graphs
• scientific article; zbMATH DE number 4060730
• Deterministic soliton automata with at most one cycle
• scientific article; zbMATH DE number 2016836
• Deterministic soliton automata with a single exterior node

zbMATH Keywords

perfect matchingchestnut graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Cited In (9)

• Soliton Automata with Multiple Waves
• The power of linear-time data reduction for maximum matching
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
• Title not available (Why is that?)
• On the König deficiency of zero-reducible graphs
• Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs
• Title not available (Why is that?)
• Deciding the deterministic property for soliton graphs
• Title not available (Why is that?)

This page was built for publication: Deterministic soliton graphs

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