Solving partition problems with colour-bipartitions (Q742575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-012-1270-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982050567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5447692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficiently solvable graph partition problem to which many problems are reducible / rank
 
Normal rank
Property / cites work
 
Property / cites work: About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Polarity and Monopolarity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-Polar Graphs: Characterization and Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: List monopolar partitions of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing line-polar bipartite graphs in time \(O(n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forbidden subgraph characterization of line-polar bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Polar Planar Graphs Using New Results for Monopolarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Injective Colourings of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:12, 9 July 2024

scientific article
Language Label Description Also known as
English
Solving partition problems with colour-bipartitions
scientific article

    Statements

    Solving partition problems with colour-bipartitions (English)
    0 references
    0 references
    0 references
    19 September 2014
    0 references
    monopolar graphs
    0 references
    unipolar graphs
    0 references
    edge-coloured graphs
    0 references
    partition problems
    0 references
    polynomial algorithm
    0 references

    Identifiers