Boxicity of graphs with bounded degree (Q1024326): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2008.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106120818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the boxicity of a graph by covering its complement by cointerval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chordality of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval representations of planar graphs / rank
 
Normal rank

Latest revision as of 16:45, 1 July 2024

scientific article
Language Label Description Also known as
English
Boxicity of graphs with bounded degree
scientific article

    Statements