A note on the bichromatic numbers of graphs

DOI10.1002/jgt.20479zbMath1225.05192OpenAlexW4240883746MaRDI QIDQ3061187

Dennis D. A. Epple, Jing Huang

Publication date: 14 December 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20479

zbMATH Keywords

characterizationcomputationgraph partitioncographbichromatic number (binary chromatic number)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

A Brooks‐Type Theorem for the Bichromatic Number, \((k,l)\)-colourings and Ferrers diagram representations of cographs

Cites Work

• Unnamed Item
• Excluding induced subgraphs. II: Extremal graphs
• The maximum edit distance from hereditary graph properties
• Complement reducible graphs
• Partitioning chordal graphs into independent sets and cliques
• Characterizing –partitionable Cographs
• On the editing distance of graphs