Bipartable graphs

DOI10.1016/0095-8956(88)90050-0zbMath0599.05050OpenAlexW4213049991MaRDI QIDQ1080439

B. George

Publication date: 1988

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(88)90050-0

zbMATH Keywords

bipartite graphpolynomial algorithmperfectly orderable graphsoptimal coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Bipolarizable graphs ⋮ Which claw-free graphs are perfectly orderable? ⋮ Recognition of some perfectly orderable graph classes

Cites Work

• Unnamed Item
• Tolerance graphs
• Which line-graphs are perfectly orderable?
• On brittle graphs
• Four classes of perfectly orderable graphs

This page was built for publication: Bipartable graphs