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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hereditary properties of graphs / 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: Q4117038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges / 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: On the maximum weight of a dense connected 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: Q3410605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Kotzig's theorem / rank
 
Normal rank

Revision as of 02:41, 12 July 2024

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

    Statements

    Identifiers