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

scientific article

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

zbMath0729.68073MaRDI QIDQ3355252

No author found.

Publication date: 1989


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tree representation\(P_ 4\)-reducible graphs


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (6)

On semi-\(P_ 4\)-sparse graphs ⋮ Recognition and isomorphism of tree-like \(P_4\)-connected graphs ⋮ On a unique tree representation for \(P_ 4\)-extendible graphs ⋮ A tree representation for \(P_ 4\)-sparse graphs ⋮ A linear-time recognition algorithm for \(P_{4}\)-reducible graphs ⋮ A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs




This page was built for publication:

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