Bipolarizable graphs (Q912868): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On brittle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All variations on perfectly orderable graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90176-i / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2912622671 / rank
 
Normal rank

Latest revision as of 09:10, 30 July 2024

scientific article
Language Label Description Also known as
English
Bipolarizable graphs
scientific article

    Statements

    Bipolarizable graphs (English)
    0 references
    0 references
    1990
    0 references
    Perfectly orderable graphs are those for which an order of the nodes can be found such that for any subgraph \(G'\) of G the sequential node coloring algorithm (``always use the smaller possible colour'') gives an optimal coloring for \(G'\). Bipolarisable graphs admit a perfect order such that for any chain \(P_ 4(a,b,c,d)\) of 4 nodes we have \(a>b\) and \(c<d\). This class of perfectly orderable graphs is compared with other known classes of perfectly orderable graph.
    0 references
    Perfectly orderable graphs
    0 references
    sequential node coloring algorithm
    0 references
    Bipolarisable graphs
    0 references

    Identifiers