A Characterization of Signed Graphs with Generalized Perfect Elimination Orderings

Details A Characterization of Signed Graphs with Generalized Perfect Elimination Orderings A Characterization of Signed Graphs with Generalized Perfect Elimination Orderings

2007-12-26

arxiv.org/abs/0712.4118v3

Discrete Mathematics vol.310, no.4 (2010) 819-831

Mathematics

Combinatorics

18 pages; (v2) Reference updated (v3) Major update including title change, shortening of proof of main theorem, addition of ap

Scientific paper

An important property of chordal graphs is that these graphs are characterized by existence of perfect elimination orderings on their vertex sets. In this paper, we generalize the notion of perfect elimination orderings to signed graphs, and give a characterization for graphs admitting such orderings, together with characterizations restricted to some subclasses and further properties of those graphs.

Affiliated with

Also associated with

No associations

Rating

A Characterization of Signed Graphs with Generalized Perfect Elimination Orderings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Characterization of Signed Graphs with Generalized Perfect Elimination Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Characterization of Signed Graphs with Generalized Perfect Elimination Orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-476894