Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A linear algorithm for disjoint matchings in trees

From MaRDI portal
Publication:1245850
Jump to:navigation, search

DOI10.1016/0012-365X(78)90085-7zbMath0376.05046MaRDI QIDQ1245850

E. J. Cockayne, Stephen T. Hedetniemi, Bert L. Hartnell

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)



Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99) Algorithms in computer science (68W99)


Related Items

Linear algorithms on recursive representations of trees



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Matchings in polytopal graphs
  • b-Matchings in Trees
  • Maximum matching and a polyhedron with 0,1-vertices
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1245850&oldid=13332139"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki