Precoloring Extension III: Classes of Perfect Graphs (Q4883061): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension. I: Interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slim graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two graph-colouring games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending an edge-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity of list colorings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:54, 24 May 2024

scientific article; zbMATH DE number 894851
Language Label Description Also known as
English
Precoloring Extension III: Classes of Perfect Graphs
scientific article; zbMATH DE number 894851

    Statements

    Precoloring Extension III: Classes of Perfect Graphs (English)
    0 references
    0 references
    0 references
    29 September 1996
    0 references
    clique number
    0 references
    maximum clique size
    0 references
    chromatic number
    0 references
    independence number
    0 references
    vertex colourings
    0 references
    precolouring extendibility
    0 references
    classes of perfect graphs
    0 references
    characterizations
    0 references
    algorithms
    0 references

    Identifiers