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:2716628
Jump to:navigation, search

zbMath0976.05053MaRDI QIDQ2716628

George Steiner

Publication date: 16 May 2001


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

zbMATH Keywords

cographsNP-completepath partitionthreshold graphsHamiltonian path problem


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items (8)

On the \(k\)-path cover problem for cacti ⋮ Unnamed Item ⋮ Approximation algorithms for the directed path partition problems ⋮ On the \(k\)-path partition of graphs. ⋮ A local search algorithm for the \(k\)-path partition problem ⋮ Approximating the directed path partition problem ⋮ Star Partitions of Perfect Graphs ⋮ NP-completeness results for some problems on subclasses of bipartite and chordal graphs







This page was built for publication:

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