8-Free Bipartite Graphs in Polynomial Time.">8-Free Bipartite Graphs in Polynomial Time., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Finding Efficient Domination for P8-Free Bipartite Graphs in ..."

Andreas Brandstädt, Raffaele Mosca (2021)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-01-21

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2101-01772
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2101-01772
Andreas Brandstädt, Raffaele Mosca:
Finding Efficient Domination for P₈-Free Bipartite Graphs in Polynomial Time. CoRR abs/2101.01772 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.