Solving partition problems with colour-bipartitions
From MaRDI portal
Publication:742575
DOI10.1007/s00373-012-1270-zzbMath1305.05187OpenAlexW1982050567MaRDI QIDQ742575
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1270-z
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Monopolar graphs: complexity of computing classical graph parameters ⋮ Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs ⋮ Unnamed Item ⋮ Recognition of unipolar and generalised split graphs ⋮ On the Polarity and Monopolarity of Graphs ⋮ Algorithms for unipolar and generalized split graphs ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around ⋮ Partitioning a graph into disjoint cliques and a triangle-free graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List monopolar partitions of claw-free graphs
- Recognizing line-polar bipartite graphs in time \(O(n)\)
- A forbidden subgraph characterization of line-polar bipartite graphs
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- An efficiently solvable graph partition problem to which many problems are reducible
- Recognizing Polar Planar Graphs Using New Results for Monopolarity
- Line-Polar Graphs: Characterization and Recognition
- Polar Permutation Graphs
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Polarity and Monopolarity of Graphs
- On Injective Colourings of Chordal Graphs
- Transitiv orientierbare Graphen
- Polar cographs
This page was built for publication: Solving partition problems with colour-bipartitions
