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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2008.10.003 / rank
Normal rank
 
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
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2008.10.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:30, 10 December 2024

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

    Statements

    Identifiers