Results 171 to 180 of about 3,384,024 (197)
A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness
Electronic Notes in Theoretical Computer Science, 2019 We consider the sandwich problem, a generalization of the recognition problem introduced by Golumbic and Shamir (1993), with respect to classes of graphs defined by excluding induced subgraphs. The Π graph sandwich problem asks, for a pair of graphs G1 =
Celina Miraglia Herrera de Figueiredo +1 more
exaly +2 more sources
A forbidden subgraph characterization of line-polar bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 A graph is polar if the vertex set can be partitioned into A and B in such a way that the subgraph induced by A is a complete multipartite graph and the subgraph induced by B is a disjoint union of cliques.
Baogang Xu, Jing Huang
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Obstructions for three-coloring graphs with one forbidden induced subgraph
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016M. Chudnovsky +3 more
semanticscholar +2 more sources
Forbidden induced subgraphs for toughness
J. Graph Theory, 2013Summary: Let \(\mathcal F\) be a family of connected graphs. A graph \(G\) is said to be \(\mathcal F\)-free if \(G\) is \(H\)-free for every graph \(H\) in \(\mathcal F\). We study the relation between forbidden subgraphs in a connected graph \(G\) and the resulting toughness of \(G\). In particular, we consider the problem of characterizing the graph
Katsuhiro Ota, Gabriel Sueiro
openaire +3 more sources
Forbidden Induced Subgraphs for Perfect Matchings
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhiro Ota, Gabriel Sueiro
openaire +1 more source
The forbidden subgraph characterization of directed vertex graphs [PDF]
Discrete Mathematics, 1999 A graph is called a directed vertex (DV) graph if it is the intersection graph of a family of directed paths in a directed tree, i.e., a tree in which each edge is oriented, with one or more vertices of indegree zero.
B S Panda
exaly +2 more sources
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
arXiv.orgA graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is said to be word-representable if there exists a word $w$ over the alphabet $V(G)$ such that, for any two distinct letters $x,y \in V(G)$, the letters $x$ and $y$ alternate in $w$ if and only if ...
Eshwar Srinivasan +1 more
semanticscholar +1 more source
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
arXiv.orgThe class of word-representable graphs, introduced in connection with the study of the Perkins semigroup by Kitaev and Seif, has attracted significant attention in combinatorics and theoretical computer science due to its deep connections with graph ...
Eshwar Srinivasan +1 more
semanticscholar +1 more source
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
SIAM Journal on Discrete Mathematics, 2008The leaf graph of a connected graph is obtained by joining a new vertex of degree one to each noncutting vertex. We prove that if a connected graph $G$ is not dominated by any of its induced paths, then $G$ is dominated by a connected induced subgraph whose leaf graph, too, is an induced subgraph of $G$. It follows that, for every nonempty class ${\cal
Zsolt Tuza
exaly +2 more sources
k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5
International Colloquium on Automata, Languages and ProgrammingA graph $G=(V,E)$ is a $k$-leaf power if there is a tree $T$ whose leaves are the vertices of $G$ with the property that a pair of leaves $u$ and $v$ induce an edge in $G$ if and only if they are distance at most $k$ apart in $T$.
Max Dupré la Tour +3 more
semanticscholar +1 more source