"Efficiently Recognizing the P 4-Structure of Trees and ..."

Andreas Brandstädt, Van Bang Le, Stephan Olariu (2000)

> Home

Details and statistics

DOI: 10.1007/S003730070002

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/BrandstadtLO00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/BrandstadtLO00
Andreas Brandstädt, Van Bang Le, Stephan Olariu:
Efficiently Recognizing the P ₄-Structure of Trees and of Bipartite Graphs Without Short Cycles. Graphs Comb. 16(4): 381-387 (2000)

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.