关于极小非圆完美图的多少结果.pdfVIP

Abstract Fortwo k-circular ofa Gis 1≤d≤后，a coloringgraph integers a that mappingC：y(G)H{o，1…k一1)suchd≤lc(u)一c(钉)l≤ k—d circularchromaticnumberof whenever伽∈E(G)．The G， denoted theleastrational thatthereis by xc(a)，is number§such ak-circularofG．Thecircularnumberofa coloring clique graph themaximumrational that G，denotedby％(G)，is number§such to is acircular- a G．A G called homomorphism g_k．admits graph if eachinduced HofG．A subgraph perfectgraphwc(H)=xc(H)for is ifitisnot but circular-perfect graphminimallycircular-imperfect eachofits induced proper subgraphsis．Minimally is structureof andit usedto the graph study circular-perfectgraph seemsthatthestructureof is minimallycircular-imperfectgraphs this discoverthatsomeflowersun- verycomplicated．Inpaper，we dercertainconditionsare several circular-imperfect．And minimally familiesof areconstructedfrom minimallycircular-imperfectgr印hs ofwhichisconstructed an fro