Recognizing the \(P_4\)-structure of block graphs (Q1962056): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00145-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060080121 / rank | |||
Normal rank |
Latest revision as of 11:14, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recognizing the \(P_4\)-structure of block graphs |
scientific article |
Statements
Recognizing the \(P_4\)-structure of block graphs (English)
0 references
16 July 2000
0 references
The \(P_4\)-structure of a graph \(G\) is the hypergraph on the same vertex set such that each hyperedge is a set of \(4\) vertices that induce a \(P_4\) in \(G\). It was conjectured by \textit{V. Chvátal} [Ann. Discrete Math. 21, 279-280 (1984; Zbl 0557.05043)] and proved by \textit{B. Reed} [J. Comb. Theory, Ser. B 43, 223-240 (1987; Zbl 0647.05052)] that a graph is perfect if it has the \(P_4\)-structure of a perfect graph. The authors give a polynomial time algorithm recognizing \(P_4\)-structures of block graphs, these are connected graphs in which all maximal \(2\)-connected subgraphs are complete.
0 references
hypergraph
0 references