C-perfect hypergraphs (Q3055910): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.20444 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Mixed interval hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical hypergraphs and interesting set-pair systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum number of elements of representing a set system of given rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring mixed hypergraphs: theory, algorithms and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.20444 / rank
 
Normal rank

Latest revision as of 09:11, 20 December 2024

scientific article
Language Label Description Also known as
English
C-perfect hypergraphs
scientific article

    Statements

    C-perfect hypergraphs (English)
    0 references
    0 references
    0 references
    10 November 2010
    0 references
    vertex coloring
    0 references
    upper chromatic number
    0 references
    transversal number
    0 references
    C-perfect hypergraph
    0 references
    circular hypergraph
    0 references
    mixed hypergraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references