On the \(b\)-continuity property of graphs (Q2381540): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.dam.2007.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043166964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(b\)-continuity property of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the b-continuity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The achromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph with given achromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The b-chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic spectrum of mixed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414507 / rank
 
Normal rank

Latest revision as of 15:42, 26 June 2024

scientific article
Language Label Description Also known as
English
On the \(b\)-continuity property of graphs
scientific article

    Statements

    On the \(b\)-continuity property of graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 September 2007
    0 references
    The authors consider the following two questions: (1) For any finite set of integers \(I\), does there exist a graph \(G\) with b-spectrum equal \(I\)? (2) Is the problem of deciding whether a given graph \(G\) is b-continuous NP-complete?
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity
    0 references
    graph
    0 references
    coloring
    0 references
    b-chromatic number
    0 references
    0 references