Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Kuo‐Ching Huang
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
A note on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:mi>m</mml:mi></mml:math>-near-factor-critical graphs
2018
Kuo‐Ching Huang
Ko‐Wei Lih
+
Equitable Coloring of Graphs with Intermediate Maximum Degree
2014
Bor-Liang Chen
Kuo‐Ching Huang
Ko‐Wei Lih
+
A Note on Near-factor-critical Graphs
2014
Kuo‐Ching Huang
Ko‐Wei Lih
+
Nordhaus–Gaddum-type relations of three graph coloring parameters
2013
Kuo‐Ching Huang
Ko‐Wei Lih
+
PDF
Chat
Intersecting $k$-Uniform Families Containing all the $k$-Subsets of a Given Set
2013
W. Li
Bor-Liang Chen
Kuo‐Ching Huang
Ko‐Wei Lih
+
A Common Generalization of the Theorems of Erd\H{o}s-Ko-Rado and Hilton-Milner
2013
W. Li
Bor-Liang Chen
Kuo‐Ching Huang
Ko‐Wei Lih
+
A Common Generalization of the Theorems of Erdős-Ko-Rado and Hilton-Milner
2013
W. Li
Bor-Liang Chen
Kuo‐Ching Huang
Ko‐Wei Lih
+
Nordhaus-Guddam Type Relations of Three Graph Coloring Parameters
2012
Kuo‐Ching Huang
Ko‐Wei Lih
+
PDF
Chat
THE EQUITABLE COLORINGS OF KNESER GRAPHS
2008
Bor-Liang Chen
Kuo‐Ching Huang
+
Integral distance graphs
1997
Jer-Jeong Chen
Gerard J. Chang
Kuo‐Ching Huang
+
Integral distance graphs
1997
Jer‐Jeong Chen
Gerard J. Chang
Kuo‐Ching Huang
Common Coauthors
Coauthor
Papers Together
Ko‐Wei Lih
7
Bor-Liang Chen
5
W. Li
3
Gerard J. Chang
2
Jer-Jeong Chen
1
Jer‐Jeong Chen
1
Ko‐Wei Lih
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
The Complete Intersection Theorem for Systems of Finite Sets
1997
Rudolf Ahlswede
Levon H. Khachatrian
2
+
The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets
1996
Rudolf Ahlswede
Levon H. Khachatrian
2
+
PDF
Chat
Injective Colorings of Graphs with Low Average Degree
2010
Daniel W. Cranston
Seog‐Jin Kim
Gexin Yu
2
+
PDF
Chat
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
1961
Péter L. Erdős
Chao Ko
R. Rado
2
+
On equitable coloring of bipartite graphs
1996
Ko‐Wei Lih
Pou-Lin Wu
2
+
PDF
Chat
Intersecting Families in a Subset of Boolean Lattices
2011
Jun Wang
Huajun Zhang
2
+
Intersecting families of sets and permutations: a survey
2011
Peter Borg
2
+
Injective coloring of planar graphs
2008
Yuehua Bu
Dong Chen
André Raspaud
Weifan Wang
2
+
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
1967
A. J. W. Hilton
E. C. Milner
2
+
Equitable Coloring and the Maximum Degree
1994
Bor-Liang Chen
Ko‐Wei Lih
Pou-Lin Wu
2
+
Independent sets in direct products of vertex-transitive graphs
2011
Huajun Zhang
2
+
List injective colorings of planar graphs
2010
O. V. Borodin
A. O. Ivanova
1
+
On the chromatic number of special distance graphs
1991
Margit Voigt
Hans‐Otto Walther
1
+
Combinatorial Geometry in the Plane.
1965
G. P. Johnson
H. Hadwiger
Hans Debrunner
Victor Klee
1
+
Unit-distance graphs, graphs on the integer lattice and a Ramsey type result
1995
Kiran B. Chilakamarri
Carolyn R. Mahoney
1
+
Some best possible inequalities concerning cross-intersecting families
1992
Péter Frankl
Norihide Tokushige
1
+
PDF
Chat
Injective colorings of sparse graphs
2010
Daniel W. Cranston
Seog‐Jin Kim
Gexin Yu
1
+
Old and New Unsolved Problems in Plane Geometry and Number Theory.
1992
Paul R. Halmos
Victor Klee
Stan Wagon
1
+
On Representatives of Subsets
1935
P. Hall
1
+
A survey of Nordhaus–Gaddum type relations
2012
Mustapha Aouchiche
Pierre Hansen
1
+
PDF
Chat
On Equitable Coloring of <i>d</i>-Degenerate Graphs
2005
Alexandr Kostochka
Kittikorn Nakprasit
Sriram V. Pemmaraju
1
+
Injective colorings of planar graphs with few colors
2008
Borut Lužar
Riste Škrekovski
Martin Tancer
1
+
Colouring the real line
1985
Roger B. Eggleton
Paul Erdős
Donald K. Skilton
1
+
PDF
Chat
3-Factor-Criticality in Double Domination Edge Critical Graphs
2015
Haichao Wang
Erfang Shan
Yancai Zhao
1
+
PDF
Chat
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
2007
H. A. Kierstead
Alexandr Kostochka
1
+
Characterizations of various matching extensions in graphs.
1993
Qinglin Yu
1
+
<i>Old and New Unsolved Problems in Plane Geometry and Number Theory.</i> By Victor Klee and Stan Wagon
1992
Paul R. Halmos
1
+
Polynomial reconstruction of the matching polynomial
2014
Xueliang Li
Yongtang Shi
Martin Trinks
1
+
Graph Factors and Matching Extensions
2009
Qinglin Yu
Guizhen Liu
1
+
Equitable Coloring of Graphs
2024
Ko‐Wei Lih
1
+
Factor-critical graphs with the minimum number of near-perfect matchings
2015
Tomislav Došlić
Dieter Rautenbach
1
+
Every 4‐Colorable Graph With Maximum Degree 4 Has an Equitable 4‐Coloring
2011
H. A. Kierstead
Alexandr Kostochka
1
+
Unsolved problems in geometry
1991
H. T. Croft
K. J. Falconer
Richard K. Guy
1
+
Stabilité, domination, irredondance et autres paramètres de graphes
1986
Odile Favaron
1
+
PDF
Chat
On k-factor-critical graphs
1996
Odile Favaron
1
+
Equitable Coloring of Trees
1994
Bor‐Liang Chen
Ko‐Wei Lih
1
+
A refinement of a result of Corrádi and Hajnal
2014
H. A. Kierstead
Alexandr Kostochka
1
+
PDF
Chat
Polynomial reconstruction of the matching polynomial
2015
Xueliang Li
Yongtang Shi
Martin Trinks
1
+
Kneser's conjecture, chromatic number, and homotopy
1978
László Lovász
1
+
Erdös–Ko–Rado Theorem—22 Years Later
1983
Michel Deza
Péter Frankl
1
+
Equitable and proportional coloring of trees
1983
Béla Bollobás
Richard K. Guy
1