Special issue in honour of Landon Rabern
From MaRDI portal
Publication:6091821
DOI10.1016/j.disc.2023.113507OpenAlexW4376880207MaRDI QIDQ6091821
No author found.
Publication date: 27 November 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113507
Cites Work
- Unnamed Item
- Planar graphs have independence ratio at least 3/13
- Dangerous reference graphs and semantic paradoxes
- A game generalizing Hall's theorem
- Graphs with chromatic number close to maximum degree
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
- A strengthening of Brooks' Theorem for line graphs
- The fractional chromatic number of the plane
- \(\Delta \)-critical graphs with small high vertex cliques
- Applying Gröbner basis techniques to group theory.
- The Borodin-Kostochka conjecture for graphs containing a doubly critical edge
- Truth and reflection
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- A strengthening of Brooks' theorem
- Partitioning and coloring graphs with degree constraints
- Improved lower bounds on the number of edges in list critical and online list critical graphs
- A different short proof of Brooks' theorem
- On hitting all maximum cliques with an independent set
- On Graph Associations
- Brooks' Theorem and Beyond
- A Note On Reed's Conjecture
- Paradox without Self-Reference
- A GRAPH-THEORETIC ANALYSIS OF THE SEMANTIC PARADOXES
- Destroying Noncomplete Regular Components in Graph Partitions
- The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4
- Coloring Claw-Free Graphs with $\Delta-1$ Colors
- Patterns of paradox
- Subcubic Edge‐Chromatic Critical Graphs Have Many Edges
- Coloring Graphs with Dense Neighborhoods
This page was built for publication: Special issue in honour of Landon Rabern
