Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls [PDF]
, 2022 Karl Heuer, Deniz Sarikaya
openalex +1 more source
Near-complete multipartite graphs and forbidden induced subgraphs
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Characterizing [h,2,1] graphs by minimal forbidden induced subgraphs
, 2013 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] are closed by taking induced subgraphs, therefore each one can be characterized by a family of ...
Alcón, Liliana +2 more
openaire +2 more sources
Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection
Discrete Applied Mathematics, 2017 Preliminary results of this paper appeared in the proceedings of SBPO 2012 and FAW ...
Yixin Cao +2 more
openaire +2 more sources
Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs
Let $G$ be a simple finite connected graph. The line graph $L(G)$ of graph $G$ is the graph whose vertices are the edges of $G$, where $ef \in E(L(G))$ when $e \cap f \neq \emptyset$. Iteratively, the higher order line graphs are defined inductively as $L^1(G) = L(G)$ and $L^n(G) = L(L^{n-1}(G))$ for $n \geq 2$.
Sanghi, Aryan +2 more
openaire +2 more sources
List-3-Coloring ordered graphs with a forbidden induced subgraph [PDF]
, 2022 Sepehr Hajebi, Yanjia Li, Sophie Spirkl
openalex +1 more source
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: nets and bulls [PDF]
, 2020 Karl Heuer, Deniz Sarikaya
openalex +1 more source
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Algorithmica, 2022 Jelínek V +4 more
europepmc +1 more source
Helly $\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition [PDF]
, 2016 Liliana Alcón +2 more
openalex +1 more source
List coloring ordered graphs with forbidden induced subgraphs
In the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list. The complexity of the problem in classes defined by forbidding induced subgraphs is a widely studied topic in ...
Piecyk, Marta, Rzążewski, Paweł
openaire +2 more sources