Graph imperfection. I (Q1850556): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q800826
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Colin J. H. McDiarmid / rank
 
Normal rank
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.1006/jctb.2001.2042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2913391020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability and fractional chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytope des independants d'un graphe série-parallèle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph imperfection. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and multicolouring of the induced subgraphs of the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional chromatic number of mycielski's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the width—length inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strong Perfect Graph Conjecture for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115277 / rank
 
Normal rank

Latest revision as of 19:10, 4 June 2024

scientific article
Language Label Description Also known as
English
Graph imperfection. I
scientific article

    Statements

    Graph imperfection. I (English)
    0 references
    0 references
    0 references
    10 December 2002
    0 references
    0 references
    weighted colouring
    0 references
    imperfection ratio
    0 references
    perfect graphs
    0 references
    stable set polytope
    0 references
    radio channel assignment
    0 references
    0 references