umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The Zero Forcing Number of Bijection Graphs
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2015 (English)In: Proceedings of 26th International Workshop om Combinatorial Algorithms (IWOCA 2015), Berlin-Heidelberg, 2015, Vol. 9538, p. 334-345Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Berlin-Heidelberg, 2015. Vol. 9538, p. 334-345
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-125915OAI: oai:DiVA.org:umu-125915DiVA, id: diva2:972702
Conference
26th International Workshop om Combinatorial Algorithms (IWOCA 2015)
Available from: 2016-09-22 Created: 2016-09-22 Last updated: 2018-06-07

Open Access in DiVA

No full text in DiVA

Authority records BETA

Jäger, GeroldÖhman, Lars-Daniel

Search in DiVA

By author/editor
Jäger, GeroldÖhman, Lars-Daniel
By organisation
Department of Mathematics and Mathematical Statistics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 162 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf