FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W562742013> ?p ?o ?g. }

• W562742013 abstract "Two Sequences of 2-Regular Graceful Graphs Consisting of 4-gons (J. Abrham, A. Kotzig#). A Survey of Self-Dual Polyhedra (D. Archdeacon). On Magic Labellings of Convex Polytopes (M. Baca). A Packing Problem and Geometrical Series (V. Balint). On the Bananas Surface B2 (R. Bodendiek, K. Wagner). Structural Properties and Colorings of Plane Graphs (O.V. Borodin). The Binding Number of Graphs (M. Borowiecki). Note on Algorithmic Solvability of Trahtenbrot-Zykov Problem (P. Bugata). Cartesian Dimensions of a Graph (G. Burosch, P. V. Ceccherini). The Steiner Minimal Tree Problem in L2p (D. Cieslik). On k -Connected Subgraphs of the Hypercube (T. Dvorak). On Some of My Favourite Problems in Various Branches of Combinatorics (P. Erdos). Realizability of Some Starlike Trees (D. Froncek). The Construction of All Configurations (124, 163) (H. Gropp). (p,q)-realizability of Integer Sequences with Respect to Mobius Strip (M. Hornak). Vertex Location Problems (O. Hudec). On Generation of a Class of Flowgraphs (A.J.C. Hurkens, C.A.J. Hurkens, R.W. Whitty). The Weight of a Graph (J. Ivanco). On the Kauffman Polynomial of Planar Matroids (F. Jaeger). On Symmetry Groups of Selfdual Convex Polyhedra (S. Jendrol). A Remark on 2- (u,kappa,lambda) Designs (V. Jurak). On a New Class of Intersection Graphs (M. Koebe). Asymptotic Normality of Isolated Edges in Random Subgraphs of the n -Cube (U. Konieczna). On Bounds of the Bisection Width of Cubic Graphs (A.V. Kostochka, L.S. Mel'nikov). On Random Cubical Graphs (A.V. Kostochka, A.A. Sapozhenko, K. Weber). On the Computational Complexity of Seidel's Switching (J. Kratochvil, J. Nesetril, O. Zyka). The Harmonious Chromatic Number of a Graph (A. Kundrik). Arboricity and Star Arboricity of Graphs (A. Kurek). Extended 4-Profiles of Hadamard Matrices (C. Lin, W.D. Wallis, Z. Lie). Good Family Packing (M. Loebl, S. Poljak). Solution of an Extremal Problem Concerning Edge-Partitions of Graphs (Z. Lonc). Balanced Extensions of Spare Graphs (T. Luczak, A. Rucinski). Two Results on Antisocial Families of Balls (A. Malnic, B. Mohar). Hamiltonicity of Vertex-transitive pq -Graphs (D. Marusic). On Nodes of Given Out-Degree in Random Trees (A. Meir, J.W. Moon). All Leaves and Excesses are Realizable for k =3 and All lambda (E. Mendelsohn, N. Shalaby, S. Hao). The Binding Number of k -Trees (D. Michalak). An Extension of Brook's Theorem (P. Mihok). On Sectors in a Connected Graph (L. Nebesky). Irreconstructability of Finite Undirected Graphs from Large Subgraphs (V. Nydl). On Inefficient Proofs of Existence and Complexity Classes (C.H. Papadimitriou). Optimal Coteries on a Network (C.H. Papadimitriou, M. Sideri). On Some Heuristics for the Steiner Problem in Graphs (J. Plesnik). Minimax Results and Polynomial Algorithms in VLSI Routing (A. Recski). Critical Perfect Systems of Difference Sets (D.G. Rogers). Some Operations (Not) Preserving the Integer Rounding Property (A." @default.
• W562742013 created "2016-06-24" @default.
• W562742013 creator A5070558406 @default.
• W562742013 creator A5089391826 @default.
• W562742013 date "1992-01-01" @default.
• W562742013 modified "2023-10-16" @default.
• W562742013 title "Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity" @default.
• W562742013 doi "https://doi.org/10.1016/s0167-5060(08)x7022-0" @default.
• W562742013 hasPublicationYear "1992" @default.
• W562742013 type Work @default.
• W562742013 sameAs 562742013 @default.
• W562742013 citedByCount "1" @default.
• W562742013 countsByYear W5627420132014 @default.
• W562742013 crossrefType "book" @default.
• W562742013 hasAuthorship W562742013A5070558406 @default.
• W562742013 hasAuthorship W562742013A5089391826 @default.
• W562742013 hasConcept C114614502 @default.
• W562742013 hasConcept C118615104 @default.
• W562742013 hasConcept C132525143 @default.
• W562742013 hasConcept C145691206 @default.
• W562742013 hasConcept C33923547 @default.
• W562742013 hasConcept C50820777 @default.
• W562742013 hasConcept C80899671 @default.
• W562742013 hasConceptScore W562742013C114614502 @default.
• W562742013 hasConceptScore W562742013C118615104 @default.
• W562742013 hasConceptScore W562742013C132525143 @default.
• W562742013 hasConceptScore W562742013C145691206 @default.
• W562742013 hasConceptScore W562742013C33923547 @default.
• W562742013 hasConceptScore W562742013C50820777 @default.
• W562742013 hasConceptScore W562742013C80899671 @default.
• W562742013 hasLocation W5627420131 @default.
• W562742013 hasOpenAccess W562742013 @default.
• W562742013 hasPrimaryLocation W5627420131 @default.
• W562742013 hasRelatedWork W1602826012 @default.
• W562742013 hasRelatedWork W1735141257 @default.
• W562742013 hasRelatedWork W1978453013 @default.
• W562742013 hasRelatedWork W2038665957 @default.
• W562742013 hasRelatedWork W2154031245 @default.
• W562742013 hasRelatedWork W2228991476 @default.
• W562742013 hasRelatedWork W2264982410 @default.
• W562742013 hasRelatedWork W2555204572 @default.
• W562742013 hasRelatedWork W3099192033 @default.
• W562742013 hasRelatedWork W3122614101 @default.
• W562742013 hasRelatedWork W3203541725 @default.
• W562742013 hasRelatedWork W433356234 @default.
• W562742013 hasRelatedWork W564520682 @default.
• W562742013 hasRelatedWork W573405921 @default.
• W562742013 hasRelatedWork W575482294 @default.
• W562742013 hasRelatedWork W600050264 @default.
• W562742013 hasRelatedWork W608067696 @default.
• W562742013 hasRelatedWork W609014849 @default.
• W562742013 hasRelatedWork W619209819 @default.
• W562742013 hasRelatedWork W651925765 @default.
• W562742013 isParatext "false" @default.
• W562742013 isRetracted "false" @default.
• W562742013 magId "562742013" @default.
• W562742013 workType "book" @default.