HOMOPOLAR CIRCUITS IN POLAR GRAPHSANDERSEN LD; GRANT DD.1981; CZECH. MATH. J.; ISSN 0011-4642; CSK; DA. 1981; VOL. 31; NO 2; PP. 218-228; BIBL. 9 REF.Article

SOME CHARACTERIZATION THEOREMS FOR CIRCUIT SPACES ASSOCIATED WITH GRAPHS.BRYANT V; PERFECT H.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 18; NO 2; PP. 109-124; BIBL. 5 REF.Article

ON A CLASS OF POLYNOMIALS OBTAINED FROM THE CIRCUITS IN A GRAPH AND ITS APPLICATION TO CHARACTERISTIC POLYNOMIALS OF GRAPHSFARRELL EJ.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 25; NO 2; PP. 121-133; BIBL. 10 REF.Article

CIRCUIT PRESERVING EDGE MAPS.SANDERS JH; SANDERS D.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 2; PP. 91-96; BIBL. 4 REF.Article

ON SPANNING AND DOMINATING CIRCUITS IN GRAPHS.LESNIAK FOSTER L; WILLIAMSON JE.1977; BULL. CANAD. MATH.; CANADA; DA. 1977; VOL. 20; NO 2; PP. 215-220; BIBL. 4 REF.Article

SNAKES IN POWERS OF COMPLETE GRAPHS.ABBOTT HL; DIERKER PF.1977; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1977; VOL. 32; NO 2; PP. 347-355; BIBL. 4 REF.Article

MAXIMAL CIRCUITS OF GRAPHS. I.WOODALL DR.1976; ACTA MATH. ACAD. SCI. HUNGR.; HONGR.; DA. 1976; VOL. 28; NO 1-2; PP. 77-80; BIBL. 5 REF.Article

ON LONGEST PATHS AND CIRCUITS IN GRAPHS.ZAMFIRESCU T.1976; MATH. SCAND.; DANEM.; DA. 1976; VOL. 32; NO 8; PP. 211-239; BIBL. 19 REF.Article

UNE NOUVELLE CARACTERISATION DES CIRCUITS COMPOSESCHATY G; CHEIN M.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 79-80; ABS. ENG; BIBL. 3 REF.Conference Paper

EULERSCHE LINIEN UND KREISUEBERDECKUNGEN, DIE VORGEGEBENE DURCHGAENGE IN DEN KANTEN VERMEIDEN = GRAPHE EULERIEN ET RECOUVREMENT DE CERCLES, QUI EVITE DES TRAVERSEES DONNEES D'ARETESFLEISCHNER H.1980; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1980; VOL. 29; NO 2; PP. 145-167; BIBL. 2 REF.Article

A HAMILTONIAN DECOMPOSITION OF K*_2M.2M >OU= 8TILLSON TW.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 29; NO 1; PP. 68-74; BIBL. 4 REF.Article

FINDING A MINIMUM CIRCUIT IN A GRAPHITAI A; RODEH M.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 413-423; BIBL. 10 REF.Article

COUNTEREXAMPLE TO A CONJECTURE OF JEURISSENSEYMOUR PD.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 3; PP. 315; BIBL. 1 REF.Article

AN APPLICATION OF MAXIMUM-MINIMUM DISTANCE CIRCUITS ON HYPERCUBESSIMMONS GJ.1978; LECTURE NOTES MATH.; DEU; DA. 1978; NO 686; PP. 290-299; BIBL. 5 REF.Conference Paper

NOTE ON CIRCUITS CONTAINING SPECIFIED EDGES.THOMASSEN C.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 279-280; BIBL. 1 REF.Article

THE NOMBER OF HAMILTONIAN CIRCUITS IN LARGE, HEAVILY EDGED GRAPHS.SHEEHAN J; WRIGHT EM.1977; GLASGOW MATH. J.; G.B.; DA. 1977; VOL. 18; NO 1; PP. 35-37; BIBL. 4 REF.Article

GRAPHS HAVING CIRCUITS WITH AT LEAST TWO CHORDSVOSS HJ.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 3; PP. 264-285; BIBL. 11 REF.Article

ARC DISJOINT CIRCUITS IN DIGRAPHSZHANG CUN QUAN.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 79-96; BIBL. 4 REF.Article

A MINIMAX THEOREM ON CIRCUITS IN PROJECTIVE GRAPHSLINS S.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 3; PP. 253-262; BIBL. 5 REF.Article

AN EFFICIENT PQ-GRAPH ALGORITHM FOR SOLVING THE GRAPH-REALIZATION PROBLEMFUJISHIGE S.1980; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1980; VOL. 21; NO 1; PP. 63-86; BIBL. 14 REF.Article

EINE RATIONELLE LOESUNG DES GOZINTOPROBLEMS IM KREISFREIEN BEWERTETEN GERICHTETEN GRAPHEN UND WEITERE OEKONOMISCHE INTERPRETATIONEN = UNE SOLUTION RATIONNELLE DU PROBLEME DE GOZINTO DANS UN GRAPHE ORIENTE A CIRCUIT A VALEUR DOSEE ET INTERPRETATIONS ECONOMIQUESKAEMPFE H.1979; WISSENSCHAFTL. Z. TECH. HOCHSCH. KARL-MARX-STADT; DDR; DA. 1979; VOL. 21; NO 5; PP. 645-653; BIBL. 13 REF.Article

CIRCUITS CONTAINING SPECIFIED EDGES.WOODALL DR.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 274-278; BIBL. 3 REF.Article

ON RINGS OF CIRCUITS IN PLANAR GRAPHS.LITTLE HC.1977; LECTURE NOTES MATH.; GERM.; DA. 1977; NO 622; PP. 133-140; BIBL. 1 REF.; (COMBINATORIAL MATH. AUST. CONF. 5. PROC.; MELBOURNE; 1976)Conference Paper

EIN NEUER ALGORITHMUS ZUR BESTIMMUNG EINER BASIS VON UNABHAENGIGEN ELEMENTARKREISEN IN EINEM STARK ZUSAMMENHAENGENDEN GRAPHEN. = UN NOUVEL ALGORITHME D'ESTIMATION D'UNE BASE DE CIRCUITS ELEMENTAIRES INDEPENDANTS DANS UN GRAPHE FORTEMENT CONNEXEJANICKE W.1976; ZASTOSOW. MAT.; POLSKA; DA. 1976; VOL. 15; NO 3; PP. 315-323; ABS. POL.; BIBL. 2 REF.Article

Page / 8