User Tony Huynh

2 votes

Number of edge-disjoint cycles in a holey graph

answered Jun 26, 2021 at 0:08

2 votes

What is the complexity of a special multigraph edge coloring problem

answered Jun 30, 2021 at 10:04

2 votes

Coloring infinite graph made out of copies of a finite graph

answered Jul 3, 2021 at 2:19

2 votes

Accepted

Is there any study on the bounds on the number of even cycles for planar bipartite graphs?

answered Sep 19, 2022 at 10:19

2 votes

Accepted

$W[1]$-hard and FPT about the equitable tree-coloring problem

answered Sep 29, 2021 at 11:19

2 votes

Lovasz theta function - uses

answered Sep 12, 2021 at 12:01

2 votes

Accepted

Discrepancy of chromatic number and independent covering number for $k$-regular hypergraphs

answered Sep 4, 2021 at 0:14

2 votes

Accepted

Confused about the definition of convex drawing of plane graph

answered Sep 4, 2021 at 0:35

2 votes

Clique number of $k$-critical graphs

answered Sep 19, 2023 at 10:23

2 votes

Accepted

Improving a lower bound for the minimum of the maximum frequency of an element in a family of sets

answered Feb 6, 2023 at 14:52

2 votes

Is it NP-hard to find the min set of nodes in a graph so that the set of paths joining them cover all the nodes?

answered Feb 16, 2023 at 7:02

2 votes

Accepted

Algorithm for finding a minimum weight circuit in a weighted binary matroid

answered Nov 7, 2022 at 1:28

2 votes

Accepted

Characterizing the family of maximal cliques of a cograph

answered Oct 16 at 7:59

2 votes

Ramsey-Kuratowski numbers

answered Jun 9, 2023 at 9:58

2 votes

Upper bounds on the edge clique cover number on special graph classes

answered Feb 17, 2015 at 16:06

2 votes

Cubic-exponential enumerative combinatorics

answered Dec 29, 2014 at 14:29

2 votes

extremal bipartite graph

answered Oct 29, 2015 at 15:38

2 votes

Accepted

The Hadwiger number of $L(K_n)$

answered Apr 13, 2015 at 10:27

2 votes

Accepted

Is this special line graph of a graph a known concept?

answered Feb 21, 2016 at 20:11

2 votes

Accepted

Induced matching of cycle

answered Feb 5, 2016 at 3:24

2 votes

Area of an irregular, n-sided, non-intersecting (edges) polygon algorithm

answered Feb 11, 2016 at 4:25

2 votes

List of counting proofs instead of linear algebra method in combinatorics

answered Feb 11, 2016 at 23:25

2 votes

Accepted

Connected homogeneous graphs

answered May 9, 2016 at 8:53

2 votes

Covering a graph by trees with depth constraint

answered Apr 19, 2016 at 8:53

2 votes

What classification theorems have been improved by re-categorizing?

answered Nov 21, 2012 at 17:09

2 votes

Cutting a subset in many pieces with controlled perimeter

answered Jun 10, 2013 at 13:03

2 votes

Accepted

Even sign configurations with prescribed support

answered Dec 18, 2012 at 16:59

2 votes

Probabilities in a riddle involving axiom of choice

answered Dec 9, 2013 at 17:37

2 votes

Accepted

Results where complexity bounds implies finite number of test cases

answered May 26, 2014 at 18:29

2 votes

A certain instance of the Set Covering problem

answered Jul 10, 2014 at 19:37

Stack Exchange Network

475 Answers

Number of edge-disjoint cycles in a holey graph

What is the complexity of a special multigraph edge coloring problem

Coloring infinite graph made out of copies of a finite graph

Is there any study on the bounds on the number of even cycles for planar bipartite graphs?

$W[1]$-hard and FPT about the equitable tree-coloring problem

Lovasz theta function - uses

Discrepancy of chromatic number and independent covering number for $k$-regular hypergraphs

Confused about the definition of convex drawing of plane graph

Clique number of $k$-critical graphs

Improving a lower bound for the minimum of the maximum frequency of an element in a family of sets

Is it NP-hard to find the min set of nodes in a graph so that the set of paths joining them cover all the nodes?

Algorithm for finding a minimum weight circuit in a weighted binary matroid

Characterizing the family of maximal cliques of a cograph

Ramsey-Kuratowski numbers

Upper bounds on the edge clique cover number on special graph classes

Cubic-exponential enumerative combinatorics

extremal bipartite graph

The Hadwiger number of $L(K_n)$

Is this special line graph of a graph a known concept?

Induced matching of cycle

Area of an irregular, n-sided, non-intersecting (edges) polygon algorithm

List of counting proofs instead of linear algebra method in combinatorics

Connected homogeneous graphs

Covering a graph by trees with depth constraint

What classification theorems have been improved by re-categorizing?

Cutting a subset in many pieces with controlled perimeter

Even sign configurations with prescribed support

Probabilities in a riddle involving axiom of choice

Results where complexity bounds implies finite number of test cases

A certain instance of the Set Covering problem