Results 61 to 70 of about 564 (166)
Arboricity, h-index, and dynamic algorithms [PDF]
, 2012 We propose a new data structure for manipulating graphs, called h-graph, which is particularly suited for designing dynamic algorithms. The structure itself is simple, consisting basically of a triple of elements, for each vertex of the graph.
Szwarcfiter, Jayme L. +9 more
core +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
Compatible systems of representatives
, 1994 The main result of this paper can be quickly described as follows. Let G be a bipartite graph and assume that for any vertex v of G a strongly base orderable matroid is given on the set of edges adjacent with v.
Kochol, Martin
core +1 more source
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley +1 more source
On Oriented Colourings of Graphs on Surfaces
Journal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source
Detecting cliques in CONGEST networks [PDF]
, 2018 The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems studied in this area is to determine whether for a given graph H, the input network contains a subgraph isomorphic to H or not.
Czumaj, Artur, Konrad, Christian
core +1 more source
mmodel: A workflow framework to accelerate the development of experimental simulations. [PDF]
J Chem Phys, 2023 Sun P, Marohn JA.
europepmc +1 more source
Hunting Structural Demons in Digital Reticular Chemistry: Lessons From Metal‐Organic Frameworks
Israel Journal of Chemistry, Volume 66, Issue 4, July 2026.Digital reticular chemistry is haunted by “structural demons”, chemically invalid models lurking within massive experimental and hypothetical MOF databases. This mini‐review tracks where these anomalies enter the data pipeline, evaluate the modern computational arsenal used to detect them (from rule‐based algorithms to machine‐learning classifiers ...
Yongchul G. Chung, Myoung Soo Lah
wiley +1 more source
Deterministic near-optimal distributed listing of cliques
This article is part of a collection for a Special Issue of Distributed Computing: by invitation only, this special issue highlights the best papers from the ACM Symposium on Principles of Distributed Computing (PODC 2022) held in Salerno, Italy, on July
Leitersdorf, Dean +2 more
core +1 more source