Structuring the elementary components of graphs having a perfect internal matching-Reference-Cited by-同舟云学术

Structuring the elementary components of graphs having a perfect internal matching

Published:2003-04 Issue:1-3 Volume:299 Page:179-210
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bartha Miklós,Krész Miklós

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference12 articles.

1. A structure theorem for maximum internal matchings in graphs;Bartha;Inform. Process. Lett.,1991

2. M. Bartha, E. Gombás, The Gallai-Edmonds algebra of graphs, Research Report # 9105, Department of Computer Science, Memorial University, St. John's, Canada, 1991.

3. On graphs with perfect internal matchings;Bartha;Acta Cybernet.,1995

4. M. Bartha, H. Jürgensen, Characterizing finite undirected multigraphs as indexed algebras, Research Report # 252, Department of Computer Science, The University of Western Ontario, London, Canada, 1989.

5. Elementary decomposition of soliton automata;Bartha;Acta Cybernet.,2000

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Soliton Automata with Multiple Waves;Computing with New Resources;2014

2. The monoidal structure of Turing machines;Mathematical Structures in Computer Science;2013-02-28

3. Turing Automata and Graph Machines;Electronic Proceedings in Theoretical Computer Science;2010-06-09

4. A Depth-first Algorithm to Reduce Graphs in Linear Time;2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing;2009-09

5. Deciding the deterministic property for soliton graphs;Ars Mathematica Contemporanea;2009-07-20