On the maximum number of edges in chordal graphs of bounded degree and matching number

DOI10.1007/s00453-022-00953-9OpenAlexW4220933049MaRDI QIDQ5970781

Pinar Heggernes, Paloma T. Lima, Jean R. S. Blair, Daniel Lokshtanov

Publication date: 8 December 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00953-9

zbMATH Keywords

matching numberchordal graphsmaximum number of edges

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

On the maximum number of edges in planar graphs of bounded degree and matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
• Graphs with restricted valency and matching number
• Degrees and matchings
• Graph edge coloring: a survey
• Snarks without small cycles
• Incidence matrices and interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Ramsey Numbers for Line Graphs and Perfect Graphs
• The NP-Completeness of Edge-Coloring
• On the maximum number of edges in chordal graphs of bounded degree and matching number

This page was built for publication: On the maximum number of edges in chordal graphs of bounded degree and matching number