Maximum size of a planar graph with given degree and even diameter (Q661947): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078220794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large planar graphs with given diameter and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of large planar networks with given degree and diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest planar graphs of diameter two and fixed maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(N\)-separators in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428085 / rank
 
Normal rank

Latest revision as of 22:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Maximum size of a planar graph with given degree and even diameter
scientific article

    Statements