Search Results - "Prins, Geert"

The block-cutpoint-tree of a graph by Harary, Frank, Prins, Geert

Get full text

On the equality of the partial Grundy and upper ochromatic numbers of graphs by Erdös, Paul, Hedetniemi, Stephen T., Laskar, Renu C., Prins, Geert C.E.

“…A (proper) k- coloring of a graph G is a partition Π={ V 1, V 2,…, V k } of V( G) into k independent sets, called color classes. In a k-coloring Π, a vertex v∈…”
Get full text

Uniquely Partially Orderable Graphs by Aigner, Martin, Prins, Geert

Get full text

ON THE AUTOMORPHISM GROUP OF A TREE by PRINS, GEERT CALEB ERNST

Get full text

Segment-Preserving Maps of Partial Orders by Aigner, Martin, Prins, Geert

“…A bijective map from a partial order $P$ to a partial order $Q$ is defined to be segment-preserving if the image of every segment in $P$ is a segment in $Q$…”
Get full text

Every generalized Petersen graph has a Tait coloring by Castagna, Frank, Prins, Geert

Get full text

Segment-Preserving Maps of Partial Orders by Aigner, Martin, Prins, Geert

Get full text

The number of homeomorphically irreducible trees, and other species by Harary, Frank, Prins, Geert

Get full text