Hemanshu Kaul

From MaRDI portal
Person:668045

Available identifiers

zbMath Open kaul.hemanshuMaRDI QIDQ668045

List of research outcomes





PublicationDate of PublicationType
The DP color function of clique-gluings of graphs2025-01-09Paper
On polynomial representations of the DP color function: theta graphs and their generalizations2024-11-21Paper
A note on fractional DP-coloring of graphs2024-07-10Paper
Flexible list colorings: maximizing the number of requests satisfied2024-07-02Paper
An algebraic approach for counting DP-3-colorings of sparse graphs2024-03-26Paper
On the list color function threshold2024-01-30Paper
An improved algorithm for finding maximum outerplanar subgraphs2024-01-24Paper
A Polynomial Method for Counting Colorings of $S$-labeled Graphs2023-12-18Paper
DP‐coloring Cartesian products of graphs2023-10-12Paper
Longitudinal network models and permutation‐uniform Markov chains2023-10-11Paper
DP-Coloring of Graphs from Random Covers2023-08-25Paper
Non-chromatic-adherence of the DP color function via generalized theta graphs2023-04-28Paper
On the equitable choosability of the disjoint union of stars2022-10-13Paper
The DP color function of joins and vertex-gluings of graphs2022-08-24Paper
A linear input dependence model for interdependent networks2022-06-08Paper
The DP Color Function of Clique-Gluings of Graphs2021-12-09Paper
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt2021-11-24Paper
Non-chromatic-adherence of the DP Color Function via Generalized Theta Graphs2021-10-06Paper
Criticality, the list color function, and list coloring the Cartesian product of graphs2021-07-23Paper
On Equitable List Arboricity of Graphs2021-07-12Paper
Partial DP-coloring of graphs2021-03-25Paper
A linear input dependence model for interdependent networks2021-02-09Paper
On the chromatic polynomial and counting DP-colorings of graphs2021-02-02Paper
On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations2020-12-22Paper
Combinatorial Nullstellensatz and DP-coloring of graphs2020-10-08Paper
On the Equitable Choosability of the Disjoint Union of Stars2020-08-12Paper
A simple characterization of proportionally 2-choosable graphs2020-04-30Paper
Partial DP-Coloring2020-03-04Paper
List coloring a Cartesian product with a complete bipartite factor2020-01-21Paper
On graph fall-coloring: existence and constructions2020-01-21Paper
A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)2019-12-12Paper
Proportional choosability: a new list analogue of equitable coloring2019-08-20Paper
On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs2019-03-05Paper
Total equitable list coloring2019-01-11Paper
https://portal.mardi4nfdi.de/entity/Q45598932018-12-04Paper
Reductions for the stable set problem2013-12-11Paper
Packing of graphic \(n\)-tuples2012-06-04Paper
Maximum series-parallel subgraph2012-04-26Paper
Distinguishing Chromatic Number of Cartesian Products of Graphs2011-03-15Paper
On a graph packing conjecture by Bollobás, Eldridge and Catlin2010-08-13Paper
Maximum Series-Parallel Subgraph2010-01-21Paper
Long Local Searches for Maximal Bipartite Subgraphs2009-08-20Paper
Analyzing the performance of simultaneous generalized hill climbing algorithms2007-08-17Paper
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer2007-05-15Paper
New global optima results for the Kauffman \(NK\) model: Handling dependency2006-09-12Paper
Global optima results for the Kauffman \(NK\) model2006-05-02Paper
A Note on Fractional DP-Coloring of GraphsN/APaper
Flexible list colorings: Maximizing the number of requests satisfiedN/APaper
Counting Packings of List-colorings of GraphsN/APaper

Research outcomes over time

This page was built for person: Hemanshu Kaul