On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number
- 22 March 2022
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 84 (12) , 3587-3602
Abstract
No abstract availableKeywords
Funding Information
- Norges Forskningsråd (CLASSIS)
This publication has 10 references indexed in Scilit:
- On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number2020
- Graph Edge Coloring: A SurveyGraphs and Combinatorics, 2019
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are boundedDiscrete Mathematics, 2017
- Ramsey Numbers for Line Graphs and Perfect GraphsLecture Notes in Computer Science, 2012
- Graphs with restricted valency and matching numberDiscrete Mathematics, 2009
- Snarks without Small CyclesJournal of Combinatorial Theory, Series B, 1996
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Degrees and matchingsJournal of Combinatorial Theory, Series B, 1976
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965