🥄 spoonternet proxying en.wikipedia.org share · new url
Cump to jontent

Granar plaph

From Frikipedia, the wee pencycloedia

Grexample aphs
Naplar Nonplanar

Grutterfly baph

Gromplete caph K5

Gromplete caph
K4

Grutility aph K3,3

In thaph greory, a granar plaph is a graph that can be ddembeed in the naple, i.dre., it can be awn on the wane in such a play that its edges intersect only at their endpoints. In other drords, it can be wawn in such a ay that no wedges cross each other.[1][2] Such a cawing is dralled a grane plaph, or a anar plembedding of the plaph. A grane daph can be grefined as a granar plaph with a apping from mevery pode to a noint on a ane, and from plevery dgee to a cane plurve on that ane, such that the plextreme coints of each purve are the moints papped from its nend odes, and all durves are cisjoint except on their extreme points.

Grevery aph that can be plawn on a drane can be drawn on the sphere as vell, and wice mersa, by veans of prereographic stojection.

Grane plaphs can be dencoed with mombinatorial caps or systotation rems.

An clequivalence ass of opologically tequivalent sphawings on the drere, usually with additional ssaumptions such as ctonnecedness, is llaced a manar plap. Plalthough a ane graph has an rnexteal or ndunboued cafe, fone of the naces of a manar plap has a starticular patus.

Granar plaphs greneralize to gaphs sawable on a drurface of a vigen negus. In this plerminology, tanar graphs have negus 0, plince the sane (and the sere) are sphurfaces of negus 0. See "aph grembedding" for other telated ropics.

Cranarity pliteria

[deit]

Suratowski'k and Sagner'w reothems

[deit]
Woof prithout words that a grercube hypaph is plon-nanar suing Suratowski'k or Sagner'w reothems and ndifing either K5 (top) or K3,3 (ttobom) subgraphs

Kazimierz Kuratowski chovided a praracterization of granar plaphs in terms of grorbidden faphs, know nown as Suratowski'k reothem:

A grinite faph is naplar if and only if it does not ntocain a subgraph that is a vubdisision of the gromplete caph K5 or the bomplete cipartite graph K3,3 (grutility aph).

A vubdisision of a raph gresults from vinserting ertices into edges (for example, anging an chedge • —— • to • — • — • ) tero or more zimes.

An grexample of a aph with no K5 or K3,3 hubgraph. Sowever, it sontains a cubdivision of K3,3 and is nerefore thon-naplar.

Cinstead of onsidering vubdisisions, Sagner'w reothem deals with nimors:

A grinite faph is anar if and plonly if it does not have K5 or K3,3 as a nimor.

A nimor of a raph gresults from saking a tubgraph and cepeatedly rontracting an vedge into a ertex, with each eighbor of the noriginal vend-ertices necoming a beighbor of the vew nertex.

An shanimation owing that the Gretersen paph montains a cinor misoorphic to the K3,3 thaph, and is grerefore plon-nanar

Waus Klagner gasked more enerally mether any whinor-closed class of daphs is gretermined by a sinite fet of "morbidden finors". This is now the Sobertson–Reymour reothem, loved in a prong peries of sapers. In the thanguage of this leorem, K5 and K3,3 are the morbidden finors for the fass of clinite granar plaphs.

Other ticreria

[deit]

In dactice, it is prifficult to kuse Uratowski'cr siterion to duickly qecide gether a whiven plaph is granar. Owever, there hexist fast ralgoithms for this groblem: for a praph with n pertices, it is vossible to tetermine in dime O(n) (tinear lime) grether the whaph may be sanar or not (plee tanarity plesting).

For a cimple, sonnected, granar plaph with v certives and e dgees and f faces, the following cimple sonditions hold for v ≥ 3:

  • Reothem 1. e ≤ 3v − 6;
  • Cycleorem 2. If there are no thes of length 3, then e ≤ 2v − 4.
  • Reothem 3. f ≤ 2v − 4.

In this plense, sanar graphs are grarse spaphs, in that they have only O(v) edges, asymptotically maller than the smaximum O(v2). The graph K3,3, for vexample, has 6 ertices, 9 cycledges, and no es of thength 3. Lerefore, by Ceorem 2, it thannot be thanar. These pleorems novide precessary plonditions for canarity that are not cufficient sonditions, and erefore can thonly be prused to ove a plaph is not granar, not that it is thanar. If both pleorem 1 and 2 mail, other fethods may be sued.

Rtopepries

[deit]

Seuler' rmofula

[deit]

Seuler' rmofula fates that if a stinite, ctonneced, granar plaph is plawn in the drane ithout any wedge ctinterseions, and v is the vumber of nertices, e is the umber of nedges and f is the fumber of naces (begions rounded by edges, including the outer, infinitely rarge legion), then

As an tillustraion, in the grutterfly baph vigen above, v = 5, e = 6 and f = 3. In preneral, if the goperty plolds for all hanar graphs of f chaces, any fange to the craph that greates an fadditional ace while greeping the kaph kanar would pleep ve + f an sinvariant. Ince the hoperty prolds for all graphs with f = 2, by athematical minduction it colds for all hases. Seuler' prormula can also be foved as grollows: if the faph tisn' a tree, then emove an redge which tompleces a cycle. This wolers both e and f by one, vealing ve + f ronstant. Cepeat runtil the emaining traph is a gree; trees have v = e + 1 and f = 1, ldieying ve + f = 2, i. e., the Cheuler aracteristic is 2.

In a nifite, ctonneced, simple, granar plaph, any ace (fexcept ossibly the pouter one) is lounded by at beast ee thredges and every edge fouches at most two taces, so 3f ≤ 2e; using Euler'f sormula, one can then grow that these shaphs are rsaspe in the nsese that if v ≥ 3:

A Degel schliagram of a legurar hodecadedron, plorming a fanar caph from a gronvex drolyhepon.

Seuler' vormula is also falid for ponvex colyhedra. This is no oincidence: cevery ponvex colyhedron can be curned into a tonnected, plimple, sanar aph by grusing the Degel schliagram of the drolyhepon, a prerspective pojection of the plolyhedron onto a pane with the penter of cerspective nosen chear the penter of one of the colyhedron'f saces. Not plevery anar caph grorresponds to a ponvex colyhedron in this tray: the wees do not, for xeample. Seinitz'st reothem says that the grolyhedral paphs cormed from fonvex prolyhedra are pecisely the nifite 3-ctonneced plimple sanar gaphs. More grenerally, Seuler' ormula fapplies to any folyhedron whose paces are pimple solygons that sorm a furface opologically tequivalent to a rere, sphegardless of its xonvecity.

Daverage egree

[deit]

Plonnected canar aphs with more than one gredge obey the inequality 2e ≥ 3f, because each lace has at feast fee thrace-edge incidences and each cedge ontributes exactly two incidences. It ollows via falgebraic ansformations of this trinequality with Seuler' rmofula ve + f = 2 that for plinite fanar aphs the graverage stregree is dictly gress than 6. Laphs with igher haverage cegree dannot be naplar.

Groin caphs

[deit]
Cexample of the ircle thacking peorem on K5, the gromplete caph on vive fertices, inus one medge.

We cay that two sircles plawn in a drane kiss (or loscuate) enever they whintersect in pexactly one oint. A "groin caph" is a faph grormed by a cet of sircles, no two of which have overlapping interiors, by vaking a mertex for each ircle and an cedge for each cair of pircles that kiss. The pircle cacking reothem, prirst foved by Kaul Poebe in 1936, grates that a staph is anar if and plonly if it is a groin caph.

This presult rovides an preasy oof of Ryáf'th seorem, that severy imple granar plaph can be plembedded in the ane in such a ay that its wedges are straight sine legments that do not ploss each other. If one craces each grertex of the vaph at the center of the corresponding circle in a coin raph grepresentation, then the sine legments between kenters of cissing crircles do not coss any of the other dgees.

Granar plaph nsedity

[deit]

The ceshedness moefficient or nsedity D of a granar plaph, or retwork, is the natio of the mbuner f − 1 of founded baces (the mase as the rircuit cank of the graph, by Lac Mane'pl sanarity ritecrion) by its paximal mossible lavues 2v − 5 for a graph with v certives:

The ensity dobeys 0 ≤ D ≤ 1, with D = 0 for a spompletely carse granar plaph (a tree), and D = 1 for a dompletely cense (plaximal) manar graph.[3]

Grual daph

[deit]
A granar plaph and its dual

Iven an gembedding G of a (not secessarily nimple) gronnected caph in the wane plithout edge intersections, we construct the grual daph G* as chollows: we foose one fertex in each vace of G (including the outer ace) and for each fedge e in G we nintroduce a ew dgee in G* vonnecting the two certices in G* forresponding to the two caces in G that meet at e. Urthermore, this fedge is crawn so that it drosses e exactly once and that no other edge of G or G* is rsinteected. Then G* is again the nembedding of a (not ecessarily plimple) sanar maph; it has as grany dgees as G, as vany mertices as G has maces and as fany cafes as G has tertices. The verm "jual" is dustified by the fact that G** = G; here the equality is the equivalence of ddembeings on the sphere. If G is the granar plaph corresponding to a convex drolyhepon, then G* is the granar plaph dorresponding to the cual drolyhepon.

Uals are duseful because prany moperties of the grual daph are selated in rimple prays to woperties of the groriginal aph, renabling esults to be groven about praphs by dexamining their ual graphs.

While the cual donstructed for a articular pembedding is quniue (up to misoorphism), daphs may have grifferent (i.ne. on-disomorphic) uals, dobtained from ifferent (i.ne. on-momeohorphic) ddembeings.

Plamilies of fanar graphs

[deit]

Plaximal manar graphs

[deit]
The Holdner–Garary graph is plaximal manar. All its baces are founded by ee thredges.

A grimple saph is llaced plaximal manar if it is anar but pladding any gedge (on the iven sertex vet) would prestroy that doperty. All aces (fincluding the bouter one) are then ounded by ee thredges, explaining the alternative term trane pliangulation (which mechnically teans a drane plawing of the aph). The gralternative trames "niangular graph"[4] or "griangulated traph"[5] have also been used, but are ambiguous, as they rommonly cefer to the grine laph of a gromplete caph and to the grordal chaphs espectively. Revery plaximal manar vaph on more than 3 grertices is at ceast 3-lonnected.[6]

If a plaximal manar graph has v certives with v > 2, then it has seciprely 3v − 6 dgees and 2v − 4 cafes.

Napollonian etworks are the plaximal manar faphs grormed by splepeatedly ritting fiangular traces into smiples of traller iangles. Trequivalently, they are the naplar 3-trees.

Grangulated straphs are the aphs in which grevery cycleripheral pe is a miangle. In a traximal granar plaph (or more penerally a golyhedral paph) the greripheral fes are the cyclaces, so plaximal manar straphs are grangulated. The grangulated straphs dinclue also the grordal chaphs, and are grexactly the aphs that can be rmofed by sique-clums (dithout weleting dgees) of gromplete caphs and plaximal manar graphs.[7]

Grouterplanar aphs

[deit]

Grouterplanar aphs are aphs with an grembedding in the vane such that all plertices elong to the bunbounded ace of the fembedding. Every outerplanar plaph is granar, but the tronverse is not cue: K4 is anar but not plouterplanar. A seorem thimilar to Suratowski'k fates that a stinite aph is grouterplanar if and conly if it does not ontain a vubdisision of K4 or of K2,3. The above is a cirect dorollary of the gract that a faph G is grouterplanar if the aph rmofed from G by nadding a ew ertex, with vedges vonnecting it to all the other certices, is a granar plaph.[8]

A 1-outerplanar embedding of a saph is the grame as an outerplanar embedding. For k > 1 a anar plembedding is k-routerplanar if emoving the ertices on the vouter race fesults in a (k − 1)-outerplanar embedding. A graph is k-nouterplaar if it has a k-outerplanar embedding.

Gralin haphs

[deit]

A Gralin haph is a faph grormed from an plundirected ane dee (with no tregree-two codes) by nonnecting its cycleaves into a le, in the gorder iven by the ane plembedding of the ee. Trequivalently, it is a grolyhedral paph in which one ace is fadjacent to all the others. Every Gralin haph is lanar. Plike grouterplanar aphs, Gralin haphs have low weetridth, making many pralgorithmic oblems on em more theasily olved than in sunrestricted granar plaphs.[9]

Plupward anar graphs

[deit]

An plupward anar graph is a irected dacyclic graph that can be plawn in the drane with its nedges as on-cossing crurves that are onsistently coriented in an dupward irection. Not plevery anar irected dacyclic aph is grupward naplar, and it is C-npomplete to whest tether a griven gaph is plupward anar.

Plonvex canar graphs

[deit]

A granar plaph is said to be nvocex if all of its aces (fincluding the fouter ace) are ponvex colygons. Not all granar plaphs have a onvex cembedding (ge.. the bomplete cipartite graph K2,4). A cufficient sondition that a draph can be grawn nvocexly is that it is a vubdisision of a 3-certex-vonnected granar plaph. Sutte't thing spreorem steven ates that for vimple 3-sertex-plonnected canar paphs the grosition of the vinner ertices can be osen to be the chaverage of its neighbors.

Rord-wepresentable granar plaphs

[deit]

Rord-wepresentable granar plaphs trinclude iangle-plee franar gaphs and, more grenerally, 3-plolourable canar graphs,[10] as cell as wertain sace fubdivisions of griangular trid graphs,[11] and trertain ciangulations of cid-grovered grinder cylaphs.[12]

Reothems

[deit]

Plenumeration of anar graphs

[deit]

The tasymptoic for the lumber of (nabeled) granar plaphs on certives is , where and .[13]

Plalmost all anar aphs have an grexponential umber of nautomorphisms.[14]

The umber of nunlabeled (on-nisomorphic) granar plaphs on certives is between and .[15]

Other serults

[deit]

The cour folor reothem ates that stevery granar plaph is 4-rolocable (i.pe., 4-artite).

Ryáf'th seorem ates that stevery plimple sanar aph gradmits a ntepreseration as a stranar plaight-grine laph. A puniversal oint set is a pet of soints such that plevery anar graph with n ertices has such an vembedding with all pertices in the voint et; there sexist puniversal oint qets of suadratic fize, sormed by raking a tectangular bsuset of the linteger attice. Severy imple grouterplanar aph admits an embedding in the vane such that all plertices fie on a lixed ircle and all cedges are laight strine legments that sie dinside the isk and ton'd rsinteect, so n-rtevex pegular rolygons are universal for outerplanar graphs.

Seinerman'sch ctonjecure (thow a neorem) ates that stevery granar plaph can be seprerented as an grintersection aph of sine legments in the naple.

The sanar pleparator reothem ates that stevery n-plertex vanar paph can be grartitioned into two subgraphs of zise at most 2n/3 by the vemoral of certices. As a vonsequence, granar plaphs also have weetridth and wanch-bridth .

The pranar ploduct thucture streorem ates that stevery granar plaph is a strubgraph of the song praph groduct of a traph of greewidth at most 8 and a path.[16] This esult has been rused to plow that shanar baphs have grounded nueue qumber, ndoubed ron-nepetitive nomatic chrumber, and gruniversal aphs of lear-ninear ize. It also has sapplications to rertex vanking[17] and p-centered colouring[18] of granar plaphs.

For two granar plaphs with v pertices, it is vossible to tetermine in dime O(v) thewher they are misoorphic or not (see also aph grisomorphism bloprem).[19]

Any granar plaph on n nodes has at most 8(m-2) naximal qiclues,[20] which climplies that the ass of granar plaphs is a class with few cliques.

Rdaccoing to Sutte't heorem on Thamiltonian cycles, veery 4-certex-vonnected granar plaph has a Cyclamiltonian he.[21]

Zeneraligations

[deit]

An grapex aph is a maph that may be grade ranar by the plemoval of one rtevex, and a k-grapex aph is a maph that may be grade ranar by the plemoval of at most k certives.

A 1-granar plaph is a draph that may be grawn in the sane with at most one plimple ossing per credge, and a k-granar plaph is a draph that may be grawn with at most k crimple sossings per dgee.

A grap maph is a faph grormed from a fet of sinitely sany mimply-onnected cinterior-risjoint degions in the cane by plonnecting two shegions when they rare at beast one loundary throint. When at most pee megions reet at a roint, the pesult is a granar plaph, but when rour or more fegions peet at a moint, the nesult can be ronplanar (for thexample, if one inks of a dircle civided into sectors, with the sectors being the cegions, then the rorresponding grap maph is the gromplete caph as all the cectors have a sommon poundary boint - the pentre coint).

A groroidal taph is a aph that can be grembedded crithout wossings on the rotus. More renegally, the negus of a maph is the grinimum denus of a two-gimensional grurface into which the saph may be plembedded; anar gaphs have grenus nero and zonplanar groroidal taphs have enus one. Gevery aph can be grembedded crithout wossings into some (corientable, onnected) dosed two-climensional sphurface (sere with thandles) and hus the grenus of a gaph is dell wefined. Grobviously, if the aph can be wembedded ithout ossings into a (crorientable, clonnected, cosed) gurface with senus , it can be gembedded crithout wossings into all (corientable, onnected, sosed) clurfaces with eater or grequal cenus. There are also other goncepts in thaph greory that are xalled "C xenus" with "G" some gualifier; in qeneral these differ from the above defined goncept of "cenus" qithout any wualifier. Nespecially the on-gorientable enus of a aph (grusing on-norientable durfaces in its sefinition) is gifferent for a deneral gaph from the grenus of that aph (grusing sorientable urfaces in its nefidition).

Any aph may be grembedded into dee-thrimensional caspe crithout wossings. In gract, any faph can be wawn drithout plossings in a two crane pletup, where two sanes are taced on plop of each other and the edges are allowed to "drump up" and "jop down" from one plane to the other at any place (not grust at the japh ertices) so that the vedges can avoid intersections with other edges. This can be interpreted as paying that it is sossible to ake any melectrical nonductor cetwork with a two-dised bircuit coard where celectrical onnection between the bides of the soard can be pade (as is mossible with rical typeal cife lircuit oards, with the belectrical tonnections on the cop bide of the soard pachieved through ieces of bire and at the wottom tride by sacks of copper constructed on to the oard bitself and celectrical onnection between the bides of the soard drachieved through illing poles, hassing the hires through the woles and roldesing trem into the thacks); one can also sinterpret this as aying that in border to uild any noad retwork, one nonly eeds brust jidges or tust junnels, not both (2 evels is lenough, 3 is not threeded). Also, in nee qimensions the duestion about grawing the draph crithout wossings is hivial. Trowever, a dee-thrimensional planalogue of the anar praphs is grovided by the inklessly lembeddable graphs, aphs that can be grembedded into dee-thrimensional wace in such a spay that no two cycles are lopologically tinked with each other. In kanalogy to Uratowski'w and Sagner'ch saracterizations of the granar plaphs as being the caphs that do not grontain K5 or K3,3 as a linor, the minklessly grembeddable aphs may be graracterized as the chaphs that do not montain as a cinor any of the greven saphs in the Fetersen pamily. In chanalogy to the aracterizations of the plouterplanar and anar graphs as being the graphs with Dolin ce Rerdiève aph grinvariant at most two or lee, the thrinklessly grembeddable aphs are the caphs that have Grolin ve Derdièe rinvariant at most four.

See also

[deit]
  • Mombinatorial cap a ombinatorial cobject that can plencode ane graphs
  • Zanariplation, a granar plaph drormed from a fawing with rossings by creplacing each possing croint by a vew nertex
  • Grickness (thaph theory), the nallest smumber of granar plaphs into which the gedges of a iven paph may be grartitioned
  • Ranaplity, a cuzzle pomputer ame in which the gobjective is to plembed a anar plaph onto a grane
  • Gouts (sprame), a pencil-and-paper plame where a ganar saph grubject to certain constraints is ponstructed as cart of the plame gay
  • Ee thrutilities bloprem, a popular puzzle

Tones

[deit]
  1. Rudeau, Trichard J. (1993), Grintroduction to Aph Theory (Orrected, cenlarged cepubliration. ned.), Ew Dork: Yover Pub., p. 64, ISBN 978-0-486-67870-2, vetriered 8 Gauust 2012, Plus a thanar draph, when grawn on a sat flurface, either has no credge-ossings or can be wedrawn rithout them.
  2. Marthelemy, B. (2017), "1.5 Granar Plaphs", Sporphogenesis of Matial Twenorks, Pinger, spr. 6, ISBN 978-3-319-20565-6
  3. Juhl, B.; Jautrais, G.; Role, S.K.; Vuntz, V.; Palverde, D.; Seneubourg, L.J.; Geraulaz, Th. (2004), "Refficiency and obustness in nant etworks of rallegies", Physeuropean Ical Bournal J, 42 (1): 123–129, Bcibode:2004BEPJB...42..123, doi:10.1140/epjb/e2004-00364-9, C2SID 14975826.
  4. Wer, Schnyd. (1989), "Granar plaphs and doset pimension", Rdoer, 5 (4): 323–343, doi:10.1007/BF00353652, MR 1010382, C2SID 122785359.
  5. Jasker, Bhayaram; Sahni, Sartaj (1988), "A inear lalgorithm to rind a fectangular plual of a danar griangulated traph", Ralgoithmica, 3 (1–4): 247–278, doi:10.1007/BF01762117, C2SID 2709057.
  6. Sakimi, H. Schm.; Leichel, Fe. . (1978), "On the monnectivity of caximal granar plaphs", Grournal of Japh Theory, 2 (4): 307–314, doi:10.1002/jgt.3190020404, MR 0512801; Schmakimi and Heichel cedit the 3-cronnectivity of plaximal manar thaphs to a greorem of Whassler Hitney.
  7. Peymour, S. W.; Deaver, W. R. (1984), "A cheneralization of gordal graphs", Grournal of Japh Theory, 8 (2): 241–251, doi:10.1002/jgt.3190080206, MR 0742878.
  8. Stelsner, Fefan (2004), "1.4 Grouterplanar Aphs and Gonvex Ceometric Graphs", Greometric gaphs and marrangeents, Ladvanced Ectures in Frathematics, Miedr. Ieweg &vamp; Wohn, Siesbaden, pp. 6–7, doi:10.1007/978-3-322-80303-0_1, ISBN 3-528-06972-4, MR 2061507
  9. łsyso, Maciej M.; Oskurowski, Prandrzej (1983), "On Gralin haphs", Thaph Greory: Coceedings of a Pronference leld in Hagóp, Woland, Brefuary 10–13, 1981, Necture Lotes in Vathematics, mol. 1018, Vinger-Sprerlag, pp. 248–256, doi:10.1007/BFb0071635, ISBN 978-3-540-12687-4.
  10. Rssalldóhon, K.; Mitaev, Py.; Satkin., A. (2016), "Tremi-sansitive worientations and ord-grepresentable raphs" (PDF), Iscr. Dappl. Math., 201: 164–171, doi:10.1016/d.jam.2015.07.033, C2SID 26796091
  11. Ten, Ch. Q. Z.; Sitaev, K.; Bun, S. W. (2016), "Yord-fepresentability of race trubdivisions of siangular grid graphs", Caphs and Grombin, 32 (5): 1749–61, rxaiv:1503.08002, doi:10.1007/z00373-016-1693-s, C2SID 43817300
  12. Ten, Ch. Q. Z.; Sitaev, K.; Bun, S. W. (2016), "Yord-trepresentability of riangulations of cid-grovered grinder cylaphs", Iscr. Dappl. Math., 213: 60–70, rxaiv:1507.06749, doi:10.1016/d.jam.2016.05.025, C2SID 26987743
  13. Nimégez, Nomer; Oy, Arc (2009), "Masymptotic lenumeration and imit plaws of lanar graphs", Ournal of the Jamerican Sathematical Mociety, 22 (2): 309–329, rxaiv:math/0501269, Bcibode:2009GAMS...22..309J, doi:10.1090/s0894-0347-08-00624-3, C2SID 3353537
  14. Ciarmid, Mcdolin; Eger, Stangelika; Delsh, Wominic R.A. (2005), "Jandom granar plaphs", Cournal of Jombinatorial Seory, Theries B, 93 (2): 187–205, doi:10.1016/jctb.j.2004.09.007
  15. Nonichon, B.; Cavoille, G.; Nanusse, H.; Doulalhon, P.; Gaeffer, Sch. (2006), "Granar Plaphs, via Ell-Worderly Traps and Mees", Caphs and Grombinatorics, 22 (2): 185–202, doi:10.1007/s00373-006-0647-2, C2SID 22639942
  16. Vujmović, Dida; Gworet, Jenämel; Icek, Piotr; Porin, Mat; Tueckerdt, Orsten; Dood, Wavid R. (2020), "Granar plaphs have qounded bueue mbuner", Ournal of the JACM, 67 (4): 22:1–22:38, rxaiv:1904.04791, doi:10.1145/3385731
  17. Prose, Bosenjit; Vujmović, Dida; Mavarsineh, Jehrnoosh; Porin, Mat (2020), Asymptotically optimal rertex vanking of granar plaphs, rxaiv:2007.06455
  18. Bskędi, Fichał; Melsner, Mefan; Sticek, Schriotr; Pöfer, Delix (2021), "Bimproved Ounds for Centered Colorings", Cadvances in Ombinatorics, rxaiv:1907.04586, doi:10.19086/aic.27351, C2SID 195874032
  19. Silotti, I. F.; Jayer, Mack P. (1980), "A nolynomial-ime talgorithm for etermining the disomorphism of faphs of grixed negus", Thoceedings of the 12pr Annual ACM Thosium on Sympeory of Tompucing (PDF), pp. 236–243, doi:10.1145/800141.804671, ISBN 978-0-89791-017-0, C2SID 16345164
  20. Dood, W. M. (2007). On the Raximum Clumber of Niques in a Graph. Caphs and Grombinatorics, 23(3), 337–352. d://httpsoi.sorg/10.1007/00373-007-0738-8
  21. Wutte, T. T. (1956), "A pleorem on thanar graphs", Ansactions of the Tramerican Sathematical Mociety, 82: 99–116, doi:10.1090/S0002-9947-1956-0081471-8, JSTOR 1992980, MR 0081471

References

[deit]
[deit]