The edge-closure of a claw-free graph is the line graph of a multigraph

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F12%3A43916312" target="_blank" >RIV/49777513:23520/12:43916312 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

The edge-closure of a claw-free graph is the line graph of a multigraph

Original language description

Ryjáček introduced a closure concept in claw-free graphs based on local completion at a locally connected vertex. He showed that the closure of a graph is the line graph of a triangle-free graph. Brousek and Holub gave an analogous closure concept of claw-free graphs, called the edge-closure, based on local completion at a locally connected edge. In this paper, it is shown that the edge-closure is the line graph of a multigraph.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2012

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

ARS COMBINATORIA

ISSN

0381-7032

e-ISSN

—

Volume of the periodical

106

Issue of the periodical within the volume

7

Country of publishing house

CA - CANADA

Number of pages

7

Pages from-to

289-295

UT code for WoS article

—

EID of the result in the Scopus database

—