Filtry
Counting Extensions Revisited
We consider rooted subgraphs in random graphs, that is, extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given vertices. In 1989, Spencer gave ...
Pure mathematics
- 2022 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
We present a dynamic data structure representing a graph G, which allows addition and removal of edges from G and can determine the number of appearances of a graph of a bounded size as an induced subgraph of G. The queries are answered in c...
BA - Obecná matematika
- 2013 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On dominating even subgraphs in cubic graphs
It is shown that a 3-edge connected cubic graph has a dominating even subgraph in which every component contains at least six vertices.
Pure mathematics
- 2017 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Forbidden Subgraphs that Imply 2-Factors
The connected forbidden subgraphs and pairs of connected forbidden subgraphs that imply a 2-connected graph is hamiltonian have been characterized by Bedrossian, and extensions of these excluding graphs for general graphs of order a...
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Pairs of forbidden subgraphs and 2-connected supereulerian graphs
It is proved that a 2-connected claw-free graph admits a spanning Eulerian subgraph if it is N_{1,1,4} or N_{1,2,2} or Z_5 or P_8-free. Related hamiltonicity results are also obtained....
Pure mathematics
- 2018 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Pairs of heavy subgraphs for hamiltonicity of 2-connected graphs
Let G be a graph on n vertices. An induced subgraph H of G is called heavy if there exist two nonadjacent vertices in H with degree sum at least n in G. We say that G is H-heavy if every induced subgraph of G isomorphic to H is heav...
BA - Obecná matematika
- 2012 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Forbidden subgraphs and cycle extendability
We prove several results on extendable cycles in 2-connected graphs from classes defined in terms of forbidden induced subgraphs.
BA - Obecná matematika
- 1995 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Forbidden subgraphs and Hamiltonian properties of graphs
Hamiltonian properties of graphs are the most studied part of the graph theory. In this paper there are several results involving forbidden induced subgraphs as sufficient conditions for various hamiltonian-type properties. As a generalizati...
BA - Obecná matematika
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Which k-trees are cover-incomparability graphs?
that the class of cover?incomparability graphs is not closed on induced subgraphs which makes the notion of s-subgraph which enables us to define forbidden s-subgraphs (i.e. graphs that cannot appear as s-subgraphs
BA - Obecná matematika
- 2014 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Forbidden subgraphs and the hamiltonian index of a 2-connected graph
Hamiltonian index of a graph $G$ is the smallest positive integer $k$, for which the $k$-th iterated line graph $L^k(G)$ is hamiltonian. Bedrossian characterized all pairs of forbidden induced subgraphs that imply hamiltonicity in $2$-connec...
BA - Obecná matematika
- 2014 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 z 8 238