About: Hamiltonovske problémy v dědičných třidách grafů charakterizované zakázanými indukovanými podgrafy.

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Hamiltonovske problémy v dědičných třidách grafů charakterizované zakázanými indukovanými podgrafy. Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Luczak and Pfender \cite{88} proved that if a graph $G$ is 3-connected and $K_{1,3}P_{11}$-free, then $G$ is hamiltonian. Moreover, Luczak et al. \cite{8} showed an example a non hamiltonian 3-connected $CP_{12}$-free graph. This result give a motivation to find an upper bound for the number $i$ such that every 3-connected $CZ_{i}$-free graph is hamiltonian. We will show that if a $G$ is 3-connected and $CZ_{6}$-free graph, then $G$ is hamiltonian. Pairs of connected graphs $X,Y$ such that a graph $G$ being 2-connected and $XY$-free implies $G$ is hamiltonian were characterized by Bedrossian. Using the closure concept for claw-free graphs, Ryj\' a\v cek simplified the characterization by showing that if considering the closure of $G$, the list in the Bedrossian's characterization can be reduced to one pair, namely, $K_{1,3},N_{1,1,1}$ (where $K_{i,j}$ is the complete bipartite graph, and $N_{i,j,k}$ is the graph obtained by identifying end vertices of three disjoint paths of l Luczak and Pfender \cite{88} proved that if a graph $G$ is 3-connected and $K_{1,3}P_{11}$-free, then $G$ is hamiltonian. Moreover, Luczak et al. \cite{8} showed an example a non hamiltonian 3-connected $CP_{12}$-free graph. This result give a motivation to find an upper bound for the number $i$ such that every 3-connected $CZ_{i}$-free graph is hamiltonian. We will show that if a $G$ is 3-connected and $CZ_{6}$-free graph, then $G$ is hamiltonian. Pairs of connected graphs $X,Y$ such that a graph $G$ being 2-connected and $XY$-free implies $G$ is hamiltonian were characterized by Bedrossian. Using the closure concept for claw-free graphs, Ryj\' a\v cek simplified the characterization by showing that if considering the closure of $G$, the list in the Bedrossian's characterization can be reduced to one pair, namely, $K_{1,3},N_{1,1,1}$ (where $K_{i,j}$ is the complete bipartite graph, and $N_{i,j,k}$ is the graph obtained by identifying end vertices of three disjoint paths of l (en)
Title	Hamiltonovske problémy v dědičných třidách grafů charakterizované zakázanými indukovanými podgrafy. Hamiltonovske problémy v dědičných třidách grafů charakterizované zakázanými indukovanými podgrafy. (en)
skos:prefLabel	Hamiltonovske problémy v dědičných třidách grafů charakterizované zakázanými indukovanými podgrafy. Hamiltonovske problémy v dědičných třidách grafů charakterizované zakázanými indukovanými podgrafy. (en)
skos:notation	RIV/49777513:23520/09:00501757!RIV10-MSM-23520___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Saburov, Khikmat
http://linked.open.../riv/druhVysledku	O - Ostatní výsledky nezařaditelné do žádného z výše uvedených druhů výsledku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	316822
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/09:00501757
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Graph; induced subgraph; forbidden subgraph; line graph; hamiltonian graphs; factor (en)
http://linked.open.../riv/klicoveSlovo	factor line graph Graph forbidden subgraph hamiltonian graphs induced subgraph
http://linked.open...ontrolniKodProRIV	[16EAA12238DF]
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Saburov, Khikmat
http://localhost/t...ganizacniJednotka	23520

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software