On the maximum weight of a sparse connected graph of given order and size (Q293629): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00373-015-1634-2 / rank | |||
Property / author | |||
Property / author: Stanlislav Jendroľ / rank | |||
Property / author | |||
Property / author: Stanlislav Jendroľ / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C22 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6590869 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
weight of an edge | |||
Property / zbMATH Keywords: weight of an edge / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
weight of a graph | |||
Property / zbMATH Keywords: weight of a graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
connected graph | |||
Property / zbMATH Keywords: connected graph / 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.1007/s00373-015-1634-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1845343407 / rank | |||
Normal rank | |||
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 | |||
Property / DOI | |||
Property / DOI: 10.1007/S00373-015-1634-2 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:37, 9 December 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
On the maximum weight of a sparse connected graph of given order and size (English)
0 references
9 June 2016
0 references
weight of an edge
0 references
weight of a graph
0 references
connected graph
0 references