Which line-graphs are perfectly orderable?

DOI10.1002/JGT.3190140506zbMATH Open0731.05045OpenAlexW2004797596MaRDI QIDQ3356337FDOQ3356337

Authors:

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

Recommendations

• Which claw-free graphs are perfectly orderable?
• scientific article; zbMATH DE number 238425
• scientific article; zbMATH DE number 3891425
• Properly orderable graphs
• Some classes of perfectly orderable graphs
• Iterated line graphs are maximally ordered
• Universality of intervals of line graph order
• Linear orders of variables for complete graphs
• scientific article; zbMATH DE number 1958549
• A note on perfectly orderable graphs

zbMATH Keywords

perfectly orderableline-graph

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Graph theory (05C99)

Cited In (12)

• Perfectly orderable graphs are quasi-parity graphs: a short proof
• Path parity and perfection
• Bipartable graphs
• Title not available (Why is that?)
• Meyniel weakly triangulated graphs. I: Co-perfect orderability
• A charming class of perfectly orderable graphs
• Which claw-free graphs are strongly perfect?
• Title not available (Why is that?)
• Which claw-free graphs are perfectly orderable?
• A note on superbrittle graphs
• On the complexity of recognizing perfectly orderable graphs
• Bichromatic \(P_{4}\)-composition schemes for perfect orderability

This page was built for publication: Which line-graphs are perfectly orderable?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3356337)