Which line-graphs are perfectly orderable?
From MaRDI portal
Publication:3356337
DOI10.1002/jgt.3190140506zbMath0731.05045OpenAlexW2004797596MaRDI QIDQ3356337
No author found.
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140506
Graph theory (05C99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (9)
Bipartable graphs ⋮ A note on superbrittle graphs ⋮ Perfectly orderable graphs are quasi-parity graphs: a short proof ⋮ Path parity and perfection ⋮ Which claw-free graphs are strongly perfect? ⋮ Meyniel weakly triangulated graphs. I: Co-perfect orderability ⋮ A charming class of perfectly orderable graphs ⋮ Which claw-free graphs are perfectly orderable? ⋮ Bichromatic \(P_{4}\)-composition schemes for perfect orderability
This page was built for publication: Which line-graphs are perfectly orderable?