Linear Time Recognition of P4-Indifferent Graphs
DOI:
https://doi.org/10.7146/brics.v6i38.20107Resumé
A simple graph is P4-indifferent if it admits a total order < on
its nodes such that every chordless path with nodes a, b, c, d and edges
ab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize
indifferent graphs and are perfectly orderable. Recently, Hoang,
Maray and Noy gave a characterization of P4-indifferent graphs in
terms of forbidden induced subgraphs. We clarify their proof and describe
a linear time algorithm to recognize P4-indifferent graphs. When
the input is a P4-indifferent graph, then the algorithm computes an order < as above.
Key words: P4-indifference, linear time, recognition, modular decomposition.
Downloads
Publiceret
1999-12-08
Citation/Eksport
Rizzi, R. (1999). Linear Time Recognition of P4-Indifferent Graphs. BRICS Report Series, 6(38). https://doi.org/10.7146/brics.v6i38.20107
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).