Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("LITTLE CHC")

Results 1 to 13 of 13

  • Page / 1
Export

Selection :

  • and

AN INTERESTING DECOMPOSITION OF KYN,YN) INTO PLANAR SUBGRAPHSLITTLE CHC.1982; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1982; NO 952; PP. 353-357; BIBL. 4 REF.Conference Paper

ON THE NUMBER OF PARITY SETS IN A GRAPH.LITTLE CHC.1976; CANAD. J. MATH.; CANADA; DA. 1976; VOL. 28; NO 6; PP. 1167-1171; BIBL. 3 REF.Article

A CHARACTERIZATION OF CONVERTIBLE (0,1)-MATRICES.LITTLE CHC.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 3; PP. 187-208; BIBL. 10 REF.Article

AN EXTENSION OF KASTELEYN'S METHOD OF ENUMERATING THE 1-FACTORS OF PLANAR GRAPHS.LITTLE CHC.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 403; PP. 63-72; BIBL. 1 REF.; (COMB. MATH. PROC. 2ND AUST. CONF.; MELBOURNE; 1973)Conference Paper

A CHARACTERIZATION OF PLANAR CUBIC GRAPHSLITTLE CHC.1980; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1980; VOL. 29; NO 2; PP. 185-194; BIBL. 1 REF.Article

ON GRAPHS AS UNIONS OF EULERIAN GRAPHSLITTLE CHC.1978; LECTURE NOTES MATH.; DEU; DA. 1978; NO 686; PP. 206-209; BIBL. 2 REF.Conference Paper

A THEOREM ON PLANAR GRAPHS.LITTLE CHC.1976; LECTURE NOTES MATH.; GERM.; DA. 1976; NO 560; PP. 136-141; BIBL. 4 REF.; (COMB. MATH. AUST. CONF. 4. PROC.; ADELAIDE; 1975)Conference Paper

AN ADDITIVITY THEOREM FOR MAXIMUM GENUS OF A GRAPH.LITTLE CHC; RINGEISEN RD.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 21; NO 1; PP. 69-74; BIBL. 6 REF.Article

RINGS OF BONDS IN GRAPHSLITTLE CHC; HOLTON DA.1982; J. COMB. THEORY, SERV. B; ISSN 0095-8956; USA; DA. 1982; VOL. 33; NO 1; PP. 1-6; BIBL. 4 REF.Article

CYCLES IN BIPARTITE TOURNAMENTSBEINEKE LW; LITTLE CHC.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 2; PP. 140-145; BIBL. 7 REF.Article

REGULAR ODD RINGS AND NON-PLANAR GRAPHSHOLTON DA; LITTLE CHC.1982; COMBINATORICA (BP., 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 2; PP. 149-152; BIBL. 5 REF.Article

THE HADAMARD CONJECTURE AND CIRCUITS OF LENGTH FOUR IN A COMPLETE BIPARTITE GRAPHLITTLE CHC; THUENTE DJ.1981; J. AUSTR. MATH. SOC., A; AUS; DA. 1981; VOL. 31; NO 2; PP. 252-256; BIBL. 4 REF.Article

ON DEFECT-D MATCHINGS IN GRAPHS.LITTLE CHC; GRANT DD; HOLTON DA et al.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 1; PP. 41-54; BIBL. 9 REF.Article

  • Page / 1