Graphs of low chordality
Copyright policy )Graphs of low chordality
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3. We show that co-circular-arc graphs and co-circle graphs have even chordality at most 4. We also identify few other classes of graphs having bounded (by a constant) chordality values.
- Rutgers, The State University of New Jersey United States
- Max Planck Society Germany
- Max Planck Institute for Informatics Germany
induced cycles, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Graph theory (including graph drawing) in computer science, chordality, QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Mathematics
induced cycles, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Graph theory (including graph drawing) in computer science, chordality, QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Mathematics
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).11 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!