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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 15:45, 1 July 2024

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

    Statements

    Identifiers