These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
113 related articles for article (PubMed ID: 38516045)
1. Ubiquity of graphs with nowhere-linear end structure. Bowler N; Elbracht C; Erde J; Gollin JP; Heuer K; Pitz M; Teegen M J Graph Theory; 2023 Jul; 103(3):564-598. PubMed ID: 38516045 [TBL] [Abstract][Full Text] [Related]
2. On the Decomposition of Vertex-Transitive Graphs into Multicycles. Leighton FT J Res Natl Bur Stand (1977); 1983; 88(6):403-410. PubMed ID: 34566113 [TBL] [Abstract][Full Text] [Related]
3. Self-adjoint and Markovian extensions of infinite quantum graphs. Kostenko A; Mugnolo D; Nicolussi N J Lond Math Soc; 2022 Mar; 105(2):1262-1313. PubMed ID: 35912286 [TBL] [Abstract][Full Text] [Related]
4. Isometric Hamming embeddings of weighted graphs. Berleant J; Sheridan K; Condon A; Williams VV; Bathe M Discrete Appl Math; 2023 Jun; 332():119-128. PubMed ID: 37982050 [TBL] [Abstract][Full Text] [Related]
5. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. Liang Z; Wei H Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606 [TBL] [Abstract][Full Text] [Related]
6. Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. Erde J; Lehner F J Graph Theory; 2022 Nov; 101(3):559-571. PubMed ID: 36249540 [TBL] [Abstract][Full Text] [Related]
7. k-resonant benzenoid systems and k-cycle resonant graphs. Guo X; Zhang F J Chem Inf Comput Sci; 2001; 41(3):480-3. PubMed ID: 11410021 [TBL] [Abstract][Full Text] [Related]
8. Graph limits of random graphs from a subset of connected k-trees. Drmota M; Jin EY; Stufler B Random Struct Algorithms; 2019 Aug; 55(1):125-152. PubMed ID: 31423073 [TBL] [Abstract][Full Text] [Related]
10. Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. Bagheri Gh B; Feder T; Fleischner H; Subi C J Graph Theory; 2021 Feb; 96(2):269-288. PubMed ID: 33380768 [TBL] [Abstract][Full Text] [Related]
11. Weisfeiler-Lehman goes dynamic: An analysis of the expressive power of Graph Neural Networks for attributed and dynamic graphs. Beddar-Wiesing S; D'Inverno GA; Graziani C; Lachi V; Moallemy-Oureh A; Scarselli F; Thomas JM Neural Netw; 2024 May; 173():106213. PubMed ID: 38428377 [TBL] [Abstract][Full Text] [Related]
12. Nonbacktracking expansion of finite graphs. Timár G; da Costa RA; Dorogovtsev SN; Mendes JFF Phys Rev E; 2017 Apr; 95(4-1):042322. PubMed ID: 28505741 [TBL] [Abstract][Full Text] [Related]
13. On the nullity of a graph with cut-points. Gong SC; Xu GH Linear Algebra Appl; 2012 Jan; 436(1):135-142. PubMed ID: 22215910 [TBL] [Abstract][Full Text] [Related]
14. Connectivity of Triangulation Flip Graphs in the Plane. Wagner U; Welzl E Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128 [TBL] [Abstract][Full Text] [Related]
15. Hosoya Polynomials of Power Graphs of Certain Finite Groups. Rather BA; Ali F; Alsaeed S; Naeem M Molecules; 2022 Sep; 27(18):. PubMed ID: 36144814 [TBL] [Abstract][Full Text] [Related]
16. On Hamiltonian Decomposition Problem of 3-Arc Graphs. Xu G; Sun Q; Liang Z Comput Intell Neurosci; 2022; 2022():5837405. PubMed ID: 35528366 [TBL] [Abstract][Full Text] [Related]
18. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO Day MC; Hawthorne FC Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713 [TBL] [Abstract][Full Text] [Related]
19. Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes. Shabbir A; Nadeem MF; Ovais A; Ashraf F; Nasir S Comb Chem High Throughput Screen; 2022; 25(3):500-509. PubMed ID: 33297913 [TBL] [Abstract][Full Text] [Related]
20. Transforming graph states using single-qubit operations. Dahlberg A; Wehner S Philos Trans A Math Phys Eng Sci; 2018 Jul; 376(2123):. PubMed ID: 29807902 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]