Results 101 to 110 of about 566 (185)
Informatika, 2018 A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj
Relative timing information and orthology in evolutionary scenarios. [PDF]
Algorithms Mol Biol, 2023 Schaller D +5 more
europepmc +1 more source
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams
CoRR, 2018 We propose a general method performed over multivalued decision diagrams that enumerates all subgraphs of an input graph that are characterized by input forbidden induced subgraphs. Our method combines elaborations of classical set operations and the developing construction technique, called the frontier based search, for multivalued decision diagrams.
Jun Kawahara +3 more
openaire +2 more sources
Local certification of forbidden subgraphs
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local
Zeitoun, Sébastien +4 more
core +4 more sources
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Algorithmica, 2022 Jelínek V +4 more
europepmc +1 more source
Forbidden subgraph colorings and the oriented chromatic number
, 2009 . We present an improved upper bound of O(d1+ 1 m−1) for the (2,F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of edges in any member of F.
N. R. Aravind, C. R. Subramanian
core +1 more source
Long induced paths in sparse graphs and graphs with forbidden patterns
26 pages, 8 figures. Comments welcome !Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path?
Raymond, Jean-Florent +2 more
core +2 more sources
A structure theorem for graphs with no cycle with a unique chord and its consequences [PDF]
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition.
Nicolas Trotignon, Kristina Vuskovic
core
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
, 2009 In [3], Faudree and Gould showed that if a 2-connected graph contains no $K_{1,3}$ and P₆ as an induced subgraph, then the graph is hamiltonian. In this paper, we consider the extension of this result to cycles passing through specified vertices.
Tsugaki, Masao, Sugiyama, Takeshi
core +1 more source