\((k,l)\)-colourings and Ferrers diagram representations of cographs

DOI10.1016/j.ejc.2020.103208zbMath1458.05064arXiv2008.03579OpenAlexW3081230275MaRDI QIDQ2225413

Jing Huang, Dennis D. A. Epple

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.03579

zbMATH Keywords

complexityalgorithmcograph\((k,l)\)-colouringbichromatic numberFerrers diagram representation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Representing formulas of propositional logic by cographs, permutations and tables ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluding induced subgraphs. II: Extremal graphs
• \((p,k)\)-coloring problems in line graphs
• The maximum edit distance from hereditary graph properties
• Complement reducible graphs
• On cocolourings and cochromatic numbers of graphs
• Partitioning chordal graphs into independent sets and cliques
• Partitions of graphs into one or two independent sets and cliques
• Partitioning cographs into cliques and stable sets
• A note on the bichromatic numbers of graphs
• On the editing distance of graphs
• A Linear Recognition Algorithm for Cographs
• Split Graphs Having Dilworth Number Two
• On the structure of linear graphs

This page was built for publication: \((k,l)\)-colourings and Ferrers diagram representations of cographs