Linear Time Recognition of P4-Indifferent Graphs
Keyword(s):
<p>A simple graph is P4-indifferent if it admits a total order < on<br />its nodes such that every chordless path with nodes a, b, c, d and edges<br />ab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize<br /> indifferent graphs and are perfectly orderable. Recently, Hoang,<br />Maray and Noy gave a characterization of P4-indifferent graphs in<br />terms of forbidden induced subgraphs. We clarify their proof and describe<br /> a linear time algorithm to recognize P4-indifferent graphs. When<br />the input is a P4-indifferent graph, then the algorithm computes an order < as above.</p><p>Key words: P4-indifference, linear time, recognition, modular decomposition.</p><p> </p>
Keyword(s):
1995 ◽
Vol 05
(01n02)
◽
pp. 21-36
◽
Keyword(s):
2020 ◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 3
(Graph Theory)
◽
2000 ◽
Vol 11
(03)
◽
pp. 365-371
◽
Keyword(s):