Bipartable graphs

DOI10.1016/0095-8956(88)90050-0zbMATH Open0599.05050OpenAlexW4213049991MaRDI QIDQ1080439FDOQ1080439

Authors: 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

Recommendations

• Bipartization of graphs
• Bipartite bithreshold graphs
• Graphoidal bipartite graphs
• Bipartite subgraphs
• Bisplit graphs
• scientific article; zbMATH DE number 1194938
• scientific article
• Bipartite-perfect graphs
• Bipartite-perfect graphs
• On the bipartition of graphs

zbMATH Keywords

bipartite graphpolynomial algorithmoptimal coloringperfectly orderable graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Four classes of perfectly orderable graphs
• Tolerance graphs
• Which line-graphs are perfectly orderable?
• On brittle graphs

Cited In (14)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bipartitions of oriented graphs
• Bisimplicial edges in bipartite graphs
• Bipartite designs
• On bipartite‐mixed graphs
• Nearly bipartite graphs
• Bipartite-perfect graphs
• Bipartite-perfect graphs
• Which claw-free graphs are perfectly orderable?
• Bipolarizable graphs
• Title not available (Why is that?)
• Recognition of some perfectly orderable graph classes
• Title not available (Why is that?)

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)