On the maximum weight of a dense connected graph of given order and size (Q279225): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Stanlislav Jendroľ / rank
Normal rank
 
Property / author
 
Property / author: Stanlislav Jendroľ / 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.disc.2015.04.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W623241377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum weight of a planar graph of given order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum weight of a bipartite graph of given order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a max-min problem concerning weights of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4680310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Kotzig's theorem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:47, 11 July 2024

scientific article
Language Label Description Also known as
English
On the maximum weight of a dense connected graph of given order and size
scientific article

    Statements

    On the maximum weight of a dense connected graph of given order and size (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    weight of an edge
    0 references
    weight of a graph
    0 references
    connected graph
    0 references
    0 references