Simple Proofs of Results on Paths Representing All Colors in Proper Vertex-Colorings

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.23, Iss.2, 2007-04, pp. : 201-203

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Representing vertex-transitive graphs on groupoids

By Mwambene Eric

Quaestiones Mathematicae, Vol. 29, Iss. 3, 2006-09 ,pp. : 279-284

Taylor & Francis Ltd

Access to resources Recommend Favorite

Partitioning a graph into vertex-disjoint paths

By Li Jianping Steiner George

Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 3, 2005-08 ,pp. : 277-294

Akademiai Kiado

Access to resources Recommend Favorite

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions

By Liu Bin

Graphs and Combinatorics, Vol. 26, Iss. 6, 2010-11 ,pp. : 781-791

Springer Publishing Company

Access to resources Recommend Favorite

Zero Sums on Unit Square Vertex Sets and Plane Colorings

By Katz Richard Krebs Mike Shaheen Anthony

American Mathematical Monthly, Vol. 121, Iss. 7, 2014-08 ,pp. : 610-618

Mathematical Association of America

Access to resources Recommend Favorite

Simple and clear proofs of Stirling's formula

By Niizeki Shozo

International Journal of Mathematical Education in Science and Technology, Vol. 41, Iss. 4, 2010-01 ,pp. : 555-558

Taylor & Francis Ltd

Access to resources Recommend Favorite