Bipartable graphs
From MaRDI portal
We consider a construction which associates with a graph G another graph G' such that if G' is a bipartite graph, G is perfectly orderable. For such a graph G we give a polynomial algorithm for an optimal coloring by delivering a perfect order on his nodes. This class of graphs is shown to be different from the known classes of perfectly orderable graphs.
Recommendations
Cites work
Cited in
(14)- Nearly bipartite graphs
- Bipartite-perfect graphs
- Recognition of some perfectly orderable graph classes
- Bisimplicial edges in bipartite graphs
- Bipartite-perfect graphs
- scientific article; zbMATH DE number 5348111 (Why is no real title available?)
- scientific article; zbMATH DE number 4010572 (Why is no real title available?)
- Bipartite designs
- On bipartite‐mixed graphs
- scientific article; zbMATH DE number 6469239 (Why is no real title available?)
- scientific article; zbMATH DE number 7324127 (Why is no real title available?)
- Which claw-free graphs are perfectly orderable?
- Bipartitions of oriented graphs
- Bipolarizable graphs
This page was built for publication: Bipartable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080439)