Results 101 to 110 of about 735 (221)

Disjoint stars and forbidden subgraphs

open access: yesHiroshima Mathematical Journal, 2006
Let $r,k$ be integers with $r\ge 3, k\ge 2$. We prove that if $G$ is a $K_{1,r}$-free graph of order at least $(k-1)(2r-1)+1$ with $\delta(G)\ge 2$, then $G$ contains $k$ vertex-disjoint copies of $K_{1,2}$. This result is motivated by the problem of characterizing a forbidden subgraph $H$ which satisfies the statement "every $H$-free graph of ...
openaire   +2 more sources

Characterizing path graphs by forbidden induced subgraphs [PDF]

open access: green, 2009
Benjamin Lévêque   +2 more
openalex   +1 more source

DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles

open access: yesMathematics
In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj   +1 more source

On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs [PDF]

open access: gold, 2021
Yeva Fadhilah Ashari   +2 more
openalex   +1 more source

Home - About - Disclaimer - Privacy