“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

Get 2 Weeks Free

A local characterization of bounded clique-width for line graphs

A local characterization of bounded clique-width for line graphs It is shown that a line graph G has clique-width at most 8 k + 4 and NLC-width at most 4 k + 3 , if G contains a vertex whose non-neighbours induce a subgraph of clique-width k or NLC-width k in G , respectively. This relation implies that co-gem-free line graphs have clique-width at most 14 and NLC-width at most 7. It is also shown that in a line graph the neighbours of a vertex induce a subgraph of clique-width at most 4 and NLC-width at most 2. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Mathematics Elsevier
Loading next page...
 
/lp/elsevier/a-local-characterization-of-bounded-clique-width-for-line-graphs-Hgah1pn9K5

You're reading a free preview. Subscribe to read or print the entire article.

And millions more from thousands of peer-reviewed journals, for just $40/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.