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

Minimal trees of given search number

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

DOI10.1016/0012-365X(87)90131-2zbMath0626.05013MaRDI QIDQ580350

Jonathan D. H. Smith

Publication date: 1987

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


zbMATH Keywords

treeisomorphism classescutwidthautomorphisms groupsearch number


Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)


Related Items (2)

An annotated bibliography on guaranteed graph searching ⋮ Minimal trees of a given search number



Cites Work

  • The vertex separation and search number of a graph
  • Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Minimal trees of given search number

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:580350&oldid=12471977"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 07:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki