Some Bounds on the Threshold Dimension of Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F25%3A43976689" target="_blank" >RIV/49777513:23520/25:43976689 - isvavai.cz</a>
Result on the web
<a href="https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i1p33/pdf" target="_blank" >https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i1p33/pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.37236/12331" target="_blank" >10.37236/12331</a>
Alternative languages
Result language
angličtina
Original language name
Some Bounds on the Threshold Dimension of Graphs
Original language description
The threshold dimension of a graph G is the minimum number of threshold graphs whose intersection yields G. We give tight or nearly tight upper bounds for the threshold dimension of a graph in terms of various graph parameters including treewidth, maximum degree, degeneracy, number of vertices, and vertex cover number. We also study threshold dimension of random graphs and graphs with high girth.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ELECTRONIC JOURNAL OF COMBINATORICS
ISSN
1077-8926
e-ISSN
1077-8926
Volume of the periodical
32
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
"P1.33"
UT code for WoS article
001434398400001
EID of the result in the Scopus database
—