Alternating orientation and alternating colouration of perfect graphs
From MaRDI portal
Publication:1089007
DOI10.1016/0095-8956(87)90045-1zbMath0618.05039OpenAlexW2041933132MaRDI QIDQ1089007
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
Related Items (16)
Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Even and odd pairs in linegraphs of bipartite graphs ⋮ Path parity and perfection ⋮ A new property of critical imperfect graphs and some consequences ⋮ Locally perfect graphs ⋮ Recognizing simple-triangle graphs by restricted 2-chain subgraph cover ⋮ A recognition algorithm for simple-triangle graphs ⋮ The clique problem with multiple-choice constraints under a cycle-free dependency graph ⋮ Classes of perfect graphs ⋮ Short-chorded and perfect graphs ⋮ Path-bicolorable graphs ⋮ Counterexamples to three conjectures concerning perfect graphs ⋮ A vertex ordering characterization of simple-triangle graphs ⋮ Properly orderable graphs ⋮ Path-Bicolorable Graphs ⋮ Set characterizations and convex extensions for geometric convex-hull proofs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topics on perfect graphs
- Tolerance graphs
- Weakly triangulated graphs
- On a conjecture of Meyniel
- A new property of critical imperfect graphs and some consequences
- Recognizing claw-free perfect graphs
- Star-cutsets and perfect graphs
- Meyniel graphs are strongly perfect
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- On the perfect graph conjecture
- Optimizing weakly triangulated graphs
- A decomposition theorem for partially ordered sets
- Transitiv orientierbare Graphen
This page was built for publication: Alternating orientation and alternating colouration of perfect graphs