Results 1 to 10 of about 5,057 (262)
A linear delay algorithm for enumerating all connected induced subgraphs [PDF]
BMC Bioinformatics, 2019 Background Real biological and social data is increasingly being represented as graphs. Pattern-mining-based graph learning and analysis techniques report meaningful biological subnetworks that elucidate important interactions among entities.
Mohammed Alokshiya +2 more
doaj +2 more sources
Sparse induced subgraphs of large treewidth
Journal of Combinatorial Theory Series BInternational audienceMotivated by an induced counterpart of treewidth sparsifiers (i.e., sparse subgraphs keeping the treewidth large) provided by the Grid Minor theorem of Robertson and Seymour [JCTB '86] or by a result of Chekuri and Chuzhoy [SODA '15]
Edouard Bonnet
exaly +8 more sources
Vertex partitioning of graphs into odd induced subgraphs
Discussiones Mathematicae Graph Theory, 2023 A graph $G$ is called an odd (even) graph if for every vertex $v\in V(G)$, $d_G(v)$ is odd (even). Let $G$ be a graph of even order. Scott in $1992$ proved that the vertices of every connected graph of even order can be partitioned into some odd induced ...
Arman Aashtab +3 more
doaj +2 more sources
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs [PDF]
Discrete Mathematics, 2015 An undirected graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admit a VPT representation in a host tree with maximum degree at most h is denoted by [h,2,1]. The classes [h,2,1]
Alcón, Liliana Graciela +2 more
exaly +2 more sources
Characterizing path graphs by forbidden induced subgraphs
Journal of Graph Theory, 2009 International audienceA graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs.
Frédéric Maffray, Myriam Preissmann
exaly +2 more sources
Topological structures induced by chromatic partitioning of vertex set of graphic [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 This paper presents a method of constructing topologies on vertex set of a graph G induced by chromatic partition of vertex set of the graph. It introduces colour lower approximation and colour upper approximation of vertex induced subgraphs and ...
K. Lalithambigai, P. Gnanachandra
doaj +1 more source
Enumerating Maximal Induced Subgraphs [PDF]
, 2023 Given a graph G, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of G that belong to a certain hereditary graph class.
Cao, Yixin, Cao, Y
core +1 more source
On the size of induced acyclic subgraphs in random digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Graphs and ...
Joel Spencer, C.R. Subramanian
doaj +3 more sources
Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
IEEE Access, 2023 Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains.
Tao Han
doaj +1 more source
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph G of order n is implicit claw-heavy if in every induced copy of K1,3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-
Zheng Wei, Wideł Wojciech, Wang Ligong
doaj +1 more source