Necessary Edges in k-Chordalisations of Graphs. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/jco/Bodlaender03>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1023%2FA%3A1027320705349>
foaf:homepage	<https://doi.org/10.1023/A:1027320705349>
dc:identifier	DBLP journals/jco/Bodlaender03 (xsd:string)
dc:identifier	DOI doi.org%2F10.1023%2FA%3A1027320705349 (xsd:string)
dcterms:issued	2003 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/jco>
rdfs:label	Necessary Edges in k-Chordalisations of Graphs. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Hans_L._Bodlaender>
swrc:number	3 (xsd:string)
swrc:pages	283-290 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/jco/Bodlaender03/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/jco/Bodlaender03>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/jco/jco7.html#Bodlaender03>
rdfs:seeAlso	<https://doi.org/10.1023/A:1027320705349>
dc:subject	graph algorithms; chordal graphs; triangulated graphs; treewidth; interval graphs; pathwidth (xsd:string)
dc:title	Necessary Edges in k-Chordalisations of Graphs. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	7 (xsd:string)