Bipolarizable graphs

DOI10.1016/0012-365X(90)90176-IzbMath0699.05050OpenAlexW2912622671MaRDI QIDQ912868

N. E. Zubov

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90176-i

zbMATH Keywords

Bipolarisable graphsPerfectly orderable graphssequential node coloring algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (4)

Characterization and recognition of some opposition and coalition graph classes ⋮ \(P_ 4\)-comparability graphs ⋮ On opposition graphs, coalition graphs, and bipartite permutation graphs ⋮ Recognition of some perfectly orderable graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Bipartable graphs
• All variations on perfectly orderable graphs
• On brittle graphs
• Four classes of perfectly orderable graphs

This page was built for publication: Bipolarizable graphs