Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
View source
View history
Discussion
English
Log in

How many steps are necessary to separate a bigraph?

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

DOI10.1006/JCTB.2001.2067zbMATH Open1036.05029OpenAlexW2039044689MaRDI QIDQ1850581FDOQ1850581


Authors: Nicole Portmann Edit this on Wikidata

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2067




Recommendations

  • scientific article; zbMATH DE number 970800
  • On the separation number of a graph
  • On the relation of separability, bandwidth and embedding
  • scientific article; zbMATH DE number 4139782
  • Bigraphs and their algebra


Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)


Cites Work

  • Title not available (Why is that?)






This page was built for publication: How many steps are necessary to separate a bigraph?

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1850581&oldid=14233516"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 12:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki