A graph is a strict-quasi parity (SQP) graph if every induced subgraph that is not a clique contains a pair of vertices with no odd chordless path b.
We present an O(n 3) algorithm for recognizing planar strict quasi-parity graphs, based on Wen-Lian Hsu's decomposition of planar (perfect) graphs and on the ( ...
A graph is a strict-quasi parity (SQP) graph if every induced subgraph that is not a clique contains a pair of vertices with no odd chordless path between them ...
Recognizing Planar Strict Quasi-Parity Graphs. Download as BibTeX doi. Type:Journal article. Authors:Cláudia Linhares Sales, Frédéric ...
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between ...
Recognizing Planar Strict Quasi-Parity Graphs. Cláudia Linhares Sales; Frédéric Maffray; Bruce Reed. Pages: 745 - 757. Minimally Non-Preperfect Graphs of Small ...
Recognizing Planar Strict Quasi-Parity Graphs. Télécharger en BibTeX doi. Type :Article de revue. Auteurs :Cláudia Linhares Sales, Frédé ...
People also ask
How to determine if a graph is planar or not?
What makes a graph planar?
What is the maximum number of edges in a planar graph?
What is the characterization of a planar graph?
A graph $G$ is strict quasi parity (SQP) if every induced subgraph of $G$ that is not a clique contains a pair of vertices with no odd chordless path ...
Missing: Recognizing | Show results with:Recognizing
Abstract. An even pair in a graph is a pair of vertices such that every induced path between them has even length. It is known that deciding the ex-.
Aug 8, 2017 · Recognizing planar strict quasi-parity graphs. Graphs and ... On planar quasi-parity graphs. SIAM Journal on Discrete Mathematics 22 ...