A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product: 7th International Colloquium on Graph Theory

A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product: 7th International Colloquium on Graph Theory

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2009, Vol.309 (11), p.3518-3522
1. Verfasser: ILLE, P
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Mathematics
Sciences and techniques of general use
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 3522
container_issue 11
container_start_page 3518
container_title Discrete mathematics
container_volume 309
creator ILLE, P
description
format Article
fullrecord <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_21712746</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>21712746</sourcerecordid><originalsourceid>FETCH-pascalfrancis_primary_217127463</originalsourceid><addsrcrecordid>eNqNjMsKwjAUBYMoWB__cDcuC02qabciintd6KrEJLUpbRLyAP17W_EDhAPDwHAmKMFlQVJa4tsUJVmGSZrT3W2OFt632eA0LxN034N1xtQwjAE3upU8RCdHv7CHEtF7BUbD0zHbeFBC9tYEqQNELaSD0Ejo5Etx8y0UH_9E5GGFZjXrvFz_uESb0_F6OKeWec662jHNla-sUz1z74rgApNiS_N_uw9EQ0YE</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product: 7th International Colloquium on Graph Theory</title><source>Access via ScienceDirect (Elsevier)</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>ILLE, P</creator><creatorcontrib>ILLE, P</creatorcontrib><identifier>ISSN: 0012-365X</identifier><identifier>EISSN: 1872-681X</identifier><identifier>CODEN: DSMHA4</identifier><language>eng</language><publisher>Kidlington: Elsevier</publisher><subject>Algebra ; Combinatorics ; Combinatorics. Ordered structures ; Exact sciences and technology ; Mathematics ; Sciences and techniques of general use</subject><ispartof>Discrete mathematics, 2009, Vol.309 (11), p.3518-3522</ispartof><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=21712746$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>ILLE, P</creatorcontrib><title>A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product: 7th International Colloquium on Graph Theory</title><title>Discrete mathematics</title><subject>Algebra</subject><subject>Combinatorics</subject><subject>Combinatorics. Ordered structures</subject><subject>Exact sciences and technology</subject><subject>Mathematics</subject><subject>Sciences and techniques of general use</subject><issn>0012-365X</issn><issn>1872-681X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNqNjMsKwjAUBYMoWB__cDcuC02qabciintd6KrEJLUpbRLyAP17W_EDhAPDwHAmKMFlQVJa4tsUJVmGSZrT3W2OFt632eA0LxN034N1xtQwjAE3upU8RCdHv7CHEtF7BUbD0zHbeFBC9tYEqQNELaSD0Ejo5Etx8y0UH_9E5GGFZjXrvFz_uESb0_F6OKeWec662jHNla-sUz1z74rgApNiS_N_uw9EQ0YE</recordid><startdate>2009</startdate><enddate>2009</enddate><creator>ILLE, P</creator><general>Elsevier</general><scope>IQODW</scope></search><sort><creationdate>2009</creationdate><title>A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product</title><author>ILLE, P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-pascalfrancis_primary_217127463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algebra</topic><topic>Combinatorics</topic><topic>Combinatorics. Ordered structures</topic><topic>Exact sciences and technology</topic><topic>Mathematics</topic><topic>Sciences and techniques of general use</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ILLE, P</creatorcontrib><collection>Pascal-Francis</collection><jtitle>Discrete mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ILLE, P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product: 7th International Colloquium on Graph Theory</atitle><jtitle>Discrete mathematics</jtitle><date>2009</date><risdate>2009</risdate><volume>309</volume><issue>11</issue><spage>3518</spage><epage>3522</epage><pages>3518-3522</pages><issn>0012-365X</issn><eissn>1872-681X</eissn><coden>DSMHA4</coden><cop>Kidlington</cop><pub>Elsevier</pub></addata></record>
fulltext fulltext
identifier ISSN: 0012-365X
ispartof Discrete mathematics, 2009, Vol.309 (11), p.3518-3522
issn 0012-365X
1872-681X
language eng
recordid cdi_pascalfrancis_primary_21712746
source Access via ScienceDirect (Elsevier); EZB-FREE-00999 freely available EZB journals
subjects Algebra
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Mathematics
Sciences and techniques of general use
title A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product: 7th International Colloquium on Graph Theory
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T05%3A00%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20proof%20of%20a%20conjecture%20of%20Sabidussi%20on%20graphs%20idempotent%20under%20the%20lexicographic%20product:%207th%20International%20Colloquium%20on%20Graph%20Theory&rft.jtitle=Discrete%20mathematics&rft.au=ILLE,%20P&rft.date=2009&rft.volume=309&rft.issue=11&rft.spage=3518&rft.epage=3522&rft.pages=3518-3522&rft.issn=0012-365X&rft.eissn=1872-681X&rft.coden=DSMHA4&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E21712746%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true