Skip to search formSkip to main contentSkip to account menu

Perfectly orderable graph

In graph theory, a perfectly orderable graph is a graph whose vertices can be ordered in such a way that a greedy coloring algorithm with that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set into one-factors such that the… 
2007
2007
The class of hhds-free graphs properly generalizes the classes of strongly chordal graphs and distance-hereditary graphs, and… 
2006
2006
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into one-factors such that the… 
2001
2001
Abstract. Using doubly lexical orders and the notion of box partition due to de Figueiredo, Maffray, and Porto, we show that a… 
Review
1998
Review
1998
Using doubly lexical orders and the notion of box partition due to de Figueiredo, Maaray, and Porto, we show that a certain… 
1990
1990
We characterize (by forbidden induced subgraphs) those line-graphs that are perfectly orderable. Implicit in our presentation is…