Alternating orientation and alternating colouration of perfect graphs
From MaRDI portal
DOI10.1016/0095-8956(87)90045-1zbMATH Open0618.05039OpenAlexW2041933132MaRDI QIDQ1089007FDOQ1089007
Authors: Chính T. Hoàng
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90045-1
Recommendations
Cites Work
- Title not available (Why is that?)
- Transitiv orientierbare Graphen
- Weakly triangulated graphs
- A decomposition theorem for partially ordered sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Star-cutsets and perfect graphs
- Title not available (Why is that?)
- Topics on perfect graphs
- Optimizing weakly triangulated graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- Title not available (Why is that?)
- Tolerance graphs
- On a conjecture of Meyniel
- On the perfect graph conjecture
- Title not available (Why is that?)
- Recognizing claw-free perfect graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- A new property of critical imperfect graphs and some consequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Meyniel graphs are strongly perfect
Cited In (16)
- Counterexamples to three conjectures concerning perfect graphs
- Properly orderable graphs
- Path parity and perfection
- Locally perfect graphs
- A new property of critical imperfect graphs and some consequences
- A recognition algorithm for simple-triangle graphs
- Path-bicolorable graphs. (Extended abstract)
- Even and odd pairs in linegraphs of bipartite graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Title not available (Why is that?)
- Classes of perfect graphs
- Short-chorded and perfect graphs
- A vertex ordering characterization of simple-triangle graphs
- Path-bicolorable graphs
- Set characterizations and convex extensions for geometric convex-hull proofs
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
This page was built for publication: Alternating orientation and alternating colouration of perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089007)