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.
258 related articles for article (PubMed ID: 27807395)
21. Learning Hidden Graphs From Samples. Abniki A; Beigy H IEEE Trans Pattern Anal Mach Intell; 2023 Oct; 45(10):11993-12003. PubMed ID: 37285255 [TBL] [Abstract][Full Text] [Related]
22. Piecewise-linear embeddings of decussate extended θ graphs and tetrahedra. O'Keeffe M; Treacy MMJ Acta Crystallogr A Found Adv; 2022 Nov; 78(Pt 6):498-506. PubMed ID: 36318071 [TBL] [Abstract][Full Text] [Related]
23. Local Multiset Dimension of Amalgamation Graphs. Alfarisi R; Susilowati L; Dafik D; Prabhu S F1000Res; 2023; 12():95. PubMed ID: 38835804 [No Abstract] [Full Text] [Related]
24. Relating Vertex and Global Graph Entropy in Randomly Generated Graphs. Tee P; Parisis G; Berthouze L; Wakeman I Entropy (Basel); 2018 Jun; 20(7):. PubMed ID: 33265571 [TBL] [Abstract][Full Text] [Related]
25. An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. Azam NA; Shurbevski A; Nagamochi H Entropy (Basel); 2020 Aug; 22(9):. PubMed ID: 33286692 [TBL] [Abstract][Full Text] [Related]
26. 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]
27. Vertex collisions in 3-periodic nets of genus 4. Moreira de Oliveira M; Andrade GML; da Silva ER; Eon JG Acta Crystallogr A Found Adv; 2018 Sep; 74(Pt 5):600-607. PubMed ID: 30182947 [TBL] [Abstract][Full Text] [Related]
28. On the characterization of claw-free graphs with given total restrained domination number. Pi X Springerplus; 2016; 5(1):1753. PubMed ID: 27795896 [TBL] [Abstract][Full Text] [Related]
29. Isotopy classes for 3-periodic net embeddings. Power SC; Baburin IA; Proserpio DM Acta Crystallogr A Found Adv; 2020 May; 76(Pt 3):275-301. PubMed ID: 32356780 [TBL] [Abstract][Full Text] [Related]
30. Lower Bounds on the Number of Realizations of Rigid Graphs. Grasegger G; Koutschan C; Tsigaridas E Exp Math; 2020; 29(2):125-136. PubMed ID: 32655833 [TBL] [Abstract][Full Text] [Related]
31. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297 [TBL] [Abstract][Full Text] [Related]
32. Sitting Closer to Friends than Enemies, Revisited. Cygan M; Pilipczuk M; Pilipczuk M; Wojtaszczyk JO Theory Comput Syst; 2015; 56(2):394-405. PubMed ID: 26300686 [TBL] [Abstract][Full Text] [Related]
33. Common vertex matrix: a novel characterization of molecular graphs by counting. Randić M; Novič M; Plavšić D J Comput Chem; 2013 Jun; 34(16):1409-19. PubMed ID: 23619822 [TBL] [Abstract][Full Text] [Related]
35. Circulants and the Characterization of Vertex-Transitive Graphs. Leighton FT J Res Natl Bur Stand (1977); 1983; 88(6):395-402. PubMed ID: 34566112 [TBL] [Abstract][Full Text] [Related]
36. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. Nagoor Gani A; Latha SR Springerplus; 2016; 5(1):1854. PubMed ID: 27818892 [TBL] [Abstract][Full Text] [Related]
37. Computing The Energy of Certain Graphs based on Vertex Status. Khurshid A; Salman M Curr Org Synth; 2023 Aug; ():. PubMed ID: 37581326 [TBL] [Abstract][Full Text] [Related]
38. Edge Mostar Indices of Cacti Graph With Fixed Cycles. Yasmeen F; Akhter S; Ali K; Rizvi STR Front Chem; 2021; 9():693885. PubMed ID: 34307297 [TBL] [Abstract][Full Text] [Related]