Results 141 to 150 of about 6,246 (257)
Journal of Graph Theory, Volume 112, Issue 3, Page 198-208, July 2026.ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley +1 more source
Content-Based Graph Matching System Using Graph Isomorphism and Sub Graph Isomorphism Algorithms [PDF]
, 2017 Finding graph isomorphism and sub graphisomorphism is an important problem in manyapplications which deal with data modelled asgraphs. Graphs can represent biological networksat the molecular, protein, or species level.
Tun, Khin Mar Lar, Thuzar, Hla
core
Kinome-wide polypharmacology profiling of small molecules by multi-task graph isomorphism network approach. [PDF]
Acta Pharm Sin B, 2023 Bao L +7 more
europepmc +1 more source
Towards Characterization of Five‐List‐Colorability of Toroidal Graphs
Journal of Graph Theory, Volume 112, Issue 3, Page 267-275, July 2026.ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák +1 more
wiley +1 more source
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Isomorphism classes of concrete graph coverings
, 2019 Hofmeister introduced the notion of a concrete (resp., concrete regular) covering of a graph G and gave formulas for enumerating the isomorphism classes of concrete (resp., concrete regular) coverings of G [Ars Combin., 32 (1991), pp.
Kim, J, Kwak, JH, Lee, J, Feng, RQ
core +1 more source
Business Ethics, the Environment &Responsibility, Volume 35, Issue 3, Page 2512-2529, July 2026.ABSTRACT The communication of sustainable development is essential for higher education institutions (HEIs), which voluntarily prepare sustainability reports (SRs) to demonstrate commitment and inform strategic decision‐making. This study conducts a systematic literature review (SLR) to identify and analyze the challenges associated with implementing ...
Valerio Brescia +3 more
wiley +1 more source
Graph Isomorphism Problem in Databases
, 2008 This project introduces history and basic notions of the graph theory. It describes graph theory problems, possible graph representations and practical graph management in databases. Aims to subgraph and graph isomorphism.
Stejskal, Roman
core
Higher Education Quarterly, Volume 80, Issue 3, July 2026.ABSTRACT This study explores how institutional research (IR) units in South Korea and Japan are shaped by the complex interaction between government accountability pressures and organisational agency. Based on a comparative qualitative study, we propose a framework comprising four types of organisational responses to accountability pressures ...
Jeong Youn Lee +5 more
wiley +1 more source
Graph Homomorphism Revisited for Graph Matching
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core