Solving partition problems with colour-bipartitions
type: Item
instance of: scholarly article
title: Solving partition problems with colour-bipartitions
zbMATH Open document ID: 1305.05187
author: Ross Churchley
author: Jing Huang
published in: Graphs and Combinatorics
publication date: 2014-09-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6346000
zbMATH Keywords: monopolar graphs
zbMATH Keywords: unipolar graphs
zbMATH Keywords: edge-coloured graphs
zbMATH Keywords: partition problems
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: s00373-012-1270-z
OpenAlex ID: W1982050567
cites work: Q5447692
cites work: An efficiently solvable graph partition problem to which many problems are reducible
cites work: About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
cites work: On the Polarity and Monopolarity of Graphs
cites work: Line-Polar Graphs: Characterization and Recognition
cites work: List monopolar partitions of claw-free graphs
cites work: Polar Permutation Graphs
cites work: Polar cographs
cites work: Recognizing line-polar bipartite graphs in time \(O(n)\)
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
cites work: Transitiv orientierbare Graphen
cites work: A forbidden subgraph characterization of line-polar bipartite graphs
cites work: Recognizing Polar Planar Graphs Using New Results for Monopolarity
cites work: On Injective Colourings of Chordal Graphs
cites work: Q3743346
cites work: Q4869540
DOI: 10.1007/S00373-012-1270-Z
description: scientific article; zbMATH DE number 6346000