Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Cograph
Graph theory
Greedy coloring
Induced path
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Interference management in wireless networks with channel uncertainty
Xinping Yi
2014
Corpus ID: 109580478
2014
2014
“Full of Experiments and Reforms”: Bloomsbury’s Literature and Economics.
A. Keane
2014
Corpus ID: 142417768
2011
2011
Perfect one-factorizations in generalized Petersen graphs
S. Bonvicini
,
G. Mazzuoccolo
Ars Comb.
2011
Corpus ID: 8062639
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set into one-factors such that the…
Expand
2007
2007
An O(n3)-Time Recognition Algorithm for hhds-free Graphs
Elaine M. Eschen
,
C. Hoàng
,
R. Sritharan
Graphs Comb.
2007
Corpus ID: 26912343
The class of hhds-free graphs properly generalizes the classes of strongly chordal graphs and distance-hereditary graphs, and…
Expand
2006
2006
A new description of perfecly one-factorable cubic graphs
S. Bonvicini
,
G. Mazzuoccolo
2006
Corpus ID: 17346740
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into one-factors such that the…
Expand
2001
2001
Bull-Free Weakly Chordal Perfectly Orderable Graphs
R. Hayward
Graphs Comb.
2001
Corpus ID: 6578215
Abstract. Using doubly lexical orders and the notion of box partition due to de Figueiredo, Maffray, and Porto, we show that a…
Expand
Review
1998
Review
1998
Bull-free Weakly Triangulated Perfectly Orderable Graphs
R. Hayward
1998
Corpus ID: 14621141
Using doubly lexical orders and the notion of box partition due to de Figueiredo, Maaray, and Porto, we show that a certain…
Expand
1996
1996
A Note on Perfectly orderable Graphs
C. Hoàng
Discrete Applied Mathematics
1996
Corpus ID: 6520985
1996
1996
Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array
Yen-Chun Lin
Information Processing Letters
1996
Corpus ID: 28133316
1990
1990
Which line-graphs are perfectly orderable?
V. Chvátal
Journal of Graph Theory
1990
Corpus ID: 206080027
We characterize (by forbidden induced subgraphs) those line-graphs that are perfectly orderable. Implicit in our presentation is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE